scispace - formally typeset
Search or ask a question
JournalISSN: 1570-0755

Quantum Information Processing 

Springer Science+Business Media
About: Quantum Information Processing is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Quantum computer & Quantum entanglement. It has an ISSN identifier of 1570-0755. Over the lifetime, 3975 publications have been published receiving 59737 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper has reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks.
Abstract: Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entanglement as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete-time quantum walks.

883 citations

Journal ArticleDOI
TL;DR: A constructive polynomial preparation for the FRQI state from an initial state, an algorithm for quantum image compression (QIC), and processing operations for quantum images are combined to build the whole process for Quantum image processing onFRQI.
Abstract: A Flexible Representation of Quantum Images (FRQI) is proposed to provide a representation for images on quantum computers in the form of a normalized state which captures information about colors and their corresponding positions in the images. A constructive polynomial preparation for the FRQI state from an initial state, an algorithm for quantum image compression (QIC), and processing operations for quantum images are combined to build the whole process for quantum image processing on FRQI. The simulation experiments on FRQI include storing, retrieving of images and a detection of a line in binary images by applying quantum Fourier transform as a processing operation. The compression ratios of QIC between groups of same color positions range from 68.75 to 90.63% on single digit images and 6.67---31.62% on the Lena image. The FRQI provides a foundation not only to express images but also to explore theoretical and practical aspects of image processing on quantum computers.

554 citations

Journal ArticleDOI
TL;DR: Performance comparisons with FRQI reveal that NEQR can achieve a quadratic speedup in quantum image preparation, increase the compression ratio of quantum images by approximately 1.5X, and retrieve digital images from quantum images accurately.
Abstract: Quantum computation is becoming an important and effective tool to overcome the high real-time computational requirements of classical digital image processing. In this paper, based on analysis of existing quantum image representations, a novel enhanced quantum representation (NEQR) for digital images is proposed, which improves the latest flexible representation of quantum images (FRQI). The newly proposed quantum image representation uses the basis state of a qubit sequence to store the gray-scale value of each pixel in the image for the first time, instead of the probability amplitude of a qubit, as in FRQI. Because different basis states of qubit sequence are orthogonal, different gray scales in the NEQR quantum image can be distinguished. Performance comparisons with FRQI reveal that NEQR can achieve a quadratic speedup in quantum image preparation, increase the compression ratio of quantum images by approximately 1.5X, and retrieve digital images from quantum images accurately. Meanwhile, more quantum image operations related to gray-scale information in the image can be performed conveniently based on NEQR, for example partial color operations and statistical color operations. Therefore, the proposed NEQR quantum image model is more flexible and better suited for quantum image representation than other models in the literature.

487 citations

Journal ArticleDOI
TL;DR: This article presents a systematic approach to QNN research, concentrating on Hopfield-type networks and the task of associative memory, and outlines the challenge of combining the nonlinear, dissipative dynamics of neural computing and the linear, unitary dynamics of quantum computing.
Abstract: With the overwhelming success in the field of quantum information in the last decades, the `quest' for a Quantum Neural Network (QNN) model began in order to combine quantum computing with the striking properties of neural computing. This article presents a systematic approach to QNN research, which so far consists of a conglomeration of ideas and proposals. Concentrating on Hopfield-type networks and the task of associative memory, it outlines the challenge of combining the nonlinear, dissipative dynamics of neural computing and the linear, unitary dynamics of quantum computing. It establishes requirements for a meaningful QNN and reviews existing literature against these requirements. It is found that none of the proposals for a potential QNN model fully exploits both the advantages of quantum physics and computing in neural networks. An outlook on possible ways forward is given, emphasizing the idea of Open Quantum Neural Networks based on dissipative quantum computing.

460 citations

Journal ArticleDOI
TL;DR: A general definition of quantum random walks on graphs is discussed and with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog is illustrated.
Abstract: In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case. PACS: 03.67.Hk

437 citations

Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
2023216
2022476
2021405
2020427
2019377
2018341