Control fields in quantum information processing are virtually always, almost by definition, assumed to be classical. In reality, however, when such a field is used to manipulate the quantum state of qubits, the qubits never remain completely unentangled with the field. For quantum information processing this is an undesirable property, as it precludes perfect quantum computing and quantum communication. Here we consider the interaction of atomic qubits with laser fields and quantify atom-field entanglement in various cases of interest. We find that the entanglement decreases with the average number of photons $\bar{n}$ in a laser beam as $E\propto\log_2 \bar{n}/\bar{n}$ for $\bar{n}\to\infty$.
The ultimate goal of the classicality programme is to quantify the amount of quantumness of certain processes. Here, classicality is studied for a restricted type of process: quantum information processing (QIP). Under special conditions, one can force some qubits of a quantum computer into a classical state without affecting the outcome of the computation. The minimal set of conditions is described and its structure is studied. Some implications of this formalism are the increase of noise robustness, a proof of the quantumness of mixed state quantum computing and a step forward in understandi…
Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution protocols when a coherent state source is used. Previously, data post-processing schemes based on one-way classical communications were considered for use with decoy states. In this paper, we develop two data post-processing schemes for the decoy-state method using two-way classical communications. Our numerical simulation (using parameters from a specific QKD experiment as an example) results show that our scheme is able to extend the maximal secure distance from…
Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms with classical output (1D QDFT and 2D QDFT) are presented in this paper. And quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, QDFT has two advantages at least. One of advantages is that 1D and 2D QDFT has time complexity O(sqrt(N)) and O(N) respectively. The other advantage is that QDFT can process very long sign…
Classifying Measurement Incompatibility under Classical Pre- and Post-Processing Operations
S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）；Indian Institute of Science Education and Research Thiruvananthapuram（特里凡得琅印度科学教育与研究机构）；Indian Institute of Technology Bhubaneswar（布巴内斯瓦尔印度理工学院）；Shiv Nadar Institution of Eminence（希夫·纳达尔卓越学院）；University College London（伦敦大学学院）
Many present day quantum optics experiments, particularly in optical quantum information processing, rely on number-resolving photo-detection as a basic building block. In this paper we demonstrate that a simple classical optimisation technique can sometimes be employed to post-process the detector signature and improve the confidence of the measurement outcome in the presence of photon-number errors such as loss or dark-counts. While the regime in which this technique is applicable is rather restrictive, and will likely not be very useful for the large-scale quantum information processing app…
Dedicated research into the design and construction of a large scale Quantum Information Processing (QIP) system is a complicated task. The design of an experimentally feasible quantum processor must draw upon results in multiple fields; from experimental efforts in system control and fabrication through to far more abstract areas such as quantum algorithms and error correction. Recently, the adaptation of topological coding models to physical systems in optics has illustrated a possible long term pathway to truly large scale QIP. As the topological model has well defined protocols for Quantum…
The surface code is unarguably the leading quantum error correction code for 2-D nearest neighbor architectures, featuring a high threshold error rate of approximately 1%, low overhead implementations of the entire Clifford group, and flexible, arbitrarily long-range logical gates. These highly desirable features come at the cost of significant classical processing complexity. We show how to perform the processing associated with an nxn lattice of qubits, each being manipulated in a realistic, fault-tolerant manner, in O(n^2) average time per round of error correction. We also describe how to …
An analogous model system for quantum information processing is discussed, based on classical wave optics. The model system is applied to three examples that involve three qubits: ({\em i}) three-particle Greenberger-Horne-Zeilinger entanglement, ({\em ii}) quantum teleportation, and ({\em iii}) a simple quantum error correction network. It is found that the model system can successfully simulate most features of entanglement, but fails to simulate quantum nonlocality. Investigations of how far the classical simulation can be pushed show that {\em quantum nonlocality} is the essential ingredie…
Existing security proofs of quantum key distribution (QKD) suffer from two fundamental weaknesses. First, memory attacks have emerged as an important threat to the security of even device-independent quantum key distribution (DI-QKD), whenever QKD devices are re-used. This type of attacks constitutes an example of covert channels, which have attracted a lot of attention in security research in conventional cryptographic and communication systems. Second, it is often implicitly assumed that the classical post-processing units of a QKD system are trusted. This is a rather strong assumption and i…
We employ spectral analysis and compressed sensing to identify settings where a variational algorithm's cost function can be recovered purely classically or with minimal quantum computer access. We present theoretical and numerical evidence supporting the viability of sparse recovery techniques. To demonstrate this approach, we use basis pursuit denoising to efficiently recover simulated Quantum Approximate Optimization Algorithm (QAOA) instances of large system size from very few samples. Our results indicate that sparse recovery can enable a more efficient use and distribution of quantum res…
We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of "remote preparation" of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount (2S) required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires 2log_2 N bits of…
Quantum information science provides powerful technologies beyond the scope of classical physics. In practice, accurate control of quantum operations is a challenging task with current quantum devices. The implementation of high fidelity and multi-qubit quantum operations consumes massive resources and requires complicated hardware design to fight against noise. An approach to alleviating this problem is to replace quantum operations with classical processing. Despite the common practice of this approach, rigorous criteria to determine whether a given quantum operation is replaceable classical…
We review some of our recent results (with collaborators) on information processing in an ordered linear spaces framework for probabilistic theories. These include demonstrations that many "inherently quantum" phenomena are in reality quite general characteristics of non-classical theories, quantum or otherwise. As an example, a set of states in such a theory is broadcastable if, and only if, it is contained in a simplex whose vertices are cloneable, and therefore distinguishable by a single measurement. As another example, information that can be obtained about a system in this framework with…
Topological quantum error correction codes have high thresholds and are well suited to physical implementation. The minimum weight perfect matching algorithm can be used to efficiently handle errors in such codes. We perform a timing analysis of our current implementation of the minimum weight perfect matching algorithm. Our implementation performs the classical processing associated with an nxn lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only O(n^2) avera…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed, but not proven, that quantum computing provides exponential speed-up for a range of problems, such as factoring. Here we address a computational scenario of "randomness processing" in which quantum theory provably yields, not only resource reduction over classical stochastic physics, but a strictly larger class of problems which can be solved. Beyond new fo…
We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning algorithms applied to classical data. The protocol combines partial CNOT gate rotations with probabilistic projection onto the desired state. The number of additional ancilla qubits used during the implementation of the protocol, as well as the number of quantum gates, scale linearly with the number of qubits in the processing register and hence logarithmic…
Quantum computing is an emerging field of science which will eventually lead us to new and powerful logic devices with capabilities far beyond the limits of current transistor-based technology. There are certain types of problems which quantum computers can solve fundamentally faster than the tradition digital computers. There are quantum algorithms which require both superposition and entanglement (e.g. Shor algorithm). But neither the Grover algorithm nor the very first quantum algorithm due to Deutsch and Jozsa need entanglement. Is it possible to utilize classical wave superposition to spe…
An optimal estimator of quantum states based on a modified Kalman Filter is presented in this work. Such estimator acts after state measurement, allowing to obtain an optimal estimation of quantum state resulting in the output of any quantum image algorithm. Besides, a new criteria, logic, and arithmetic based on projections onto vertical axis of Bloch Sphere exclusively are presented too. This approach will allow us: 1) a simpler development of logic and arithmetic quantum operations, where they will closer to those used in the classical digital image processing algorithms, 2) building simple…
We apply the classical data processing inequality to quantum metrology to show that manipulating the classical information from a quantum measurement cannot aid in the estimation of parameters encoded in quantum states. We further derive a quantum data processing inequality to show that coherent manipulation of quantum data also cannot improve the precision in estimation. In addition, we comment on the assumptions necessary to arrive at these inequalities and how they might be avoided providing insights into enhancement procedures which are not provably wrong.
Biological information processing is generally assumed to be classical. Measured cellular energy budgets of both prokaryotes and eukaryotes, however, fall orders of magnitude short of the power required to maintain classical states of protein conformation and localization at the Å, fs scales predicted by single-molecule decoherence calculations and assumed by classical molecular dynamics models. We suggest that decoherence is limited to the immediate surroundings of the cell membrane and of intercompartmental boundaries within the cell, and that bulk cellular biochemistry implements quantum in…
The simulation of time evolution of large quantum systems is a classically challenging and in general intractable task, making it a promising application for quantum computation. A Trotter-Suzuki approximation yields an implementation thereof, where a higher approximation accuracy can be traded for an increased gate count. In this work, we introduce a variational algorithm which uses solutions of classical optimizations to predict efficient quantum circuits for time evolution of translationally invariant quantum systems. Our strategy can improve upon the Trotter-Suzuki accuracy by several orde…
Processing of digital images is continuously gaining in volume and relevance, with concomitant demands on data storage, transmission and processing power. Encoding the image information in quantum-mechanical systems instead of classical ones and replacing classical with quantum information processing may alleviate some of these challenges. By encoding and processing the image information in quantum-mechanical systems, we here demonstrate the framework of quantum image processing, where a pure quantum state encodes the image information: we encode the pixel values in the probability amplitudes …
Utilizing present and futuristic Quantum Computers to solve difficult problems in different domains has become one of the main endeavors at this moment. Of course, in arriving at the requisite solution both quantum and classical computers work in conjunction. With the continued popularity of Low Density Parity Check (LDPC) codes and hence their decoding, this paper looks into the latter as a Quadratic Unconstrained Binary Optimization (QUBO) and utilized D-Wave 2000Q Quantum Annealer to solve it. The outputs from the Annealer are classically post-processed using simple minimum distance decodin…
Harvard University（哈佛大学）；Harvard Quantum Initiative, Harvard University（哈佛量子倡议，哈佛大学）；Lincoln Laboratory, Massachusetts Institute of Technology（林肯实验室，麻省理工学院）；University of Maryland（马里兰大学）
Classical simulation is important because it sets a benchmark for quantum computer performance. Classical simulation is currently the only way to exercise larger numbers of qubits. To achieve larger simulations, sparse matrix processing is emphasized below while trading memory for processing. It performed well within NCSA supercomputers, giving a state vector in convenient continuous portions ready for post processing.
Quantum information and computation may serve as a source of useful axioms and ideas for the quantum logic/quantum structures project of characterizing and classifying types of physical theories, including quantum mechanics and classical mechanics. The axiomatic approach of quantum structures may help isolate what aspects of quantum mechanics are responsible for what aspects of its greater-than-classical information processing power, and whether more general physical theories may escape some common limitations of classical and quantum theories. Also, by by helping us understand how existing qu…
We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine its scaling in circuit depth and width. We show that the use of purely random measurements requires a number of measurements that is optimal up to constant factors, albeit at the cost of exponential classical post-processing; the method can also be used to improve classical signal processing. We then develop a quantum algorithm for phase estimation that yie…
In order to understand the source and extent of the greater-than-classical information processing power of quantum systems, one wants to characterize both classical and quantum mechanics as points in a broader space of possible theories. One approach to doing this, pioneered by Abramsky and Coecke, is to abstract the essential categorical features of classical and quantum mechanics that support various information-theoretic constraints and possibilities, e.g., the impossibility of cloning in the latter, and the possibility of teleportation in both. Another approach, pursued by the authors and …
Quasi-Monte Carlo Method for Linear Combination Unitaries via Classical Post-Processing
Graduate School of Engineering Science, The University of Osaka（大阪大学工学研究科）；Center for Quantum Information and Quantum Biology, The University of Osaka（大阪大学量子信息与量子生物学中心）；RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）
We present a representation for linguistic structure that we call a Fock-space representation, which allows us to embed problems in language processing into small quantum devices. We further develop a formalism for understanding both classical as well as quantum linguistic problems and phrase them both as a Harmony optimization problem that can be solved on a quantum computer which we show is related to classifying vectors using quantum Boltzmann machines. We further provide a new training method for learning quantum Harmony operators that describe a language. This also provides a new algorith…
A hybrid classical-quantum approach for evaluation of multi-dimensional Walsh-Hadamard transforms and its applications to quantum image processing are proposed. In this approach, multidimensional Walsh-Hadamard transforms are obtained using quantum Hadamard gates (along with state-preparation, shifting, scaling and measurement operations). The proposed approach for evaluation of multidimensional Walsh-Hadamard transform has a considerably lower computational complexity (involving $O(N^d)$ operations) in contrast to classical Fast Walsh-Hadamard transform (involving $O(N^d~\log_2 N^d)$ operatio…
We propose a simple scheme to reduce readout errors in experiments on quantum systems with finite number of measurement outcomes. Our method relies on performing classical post-processing which is preceded by Quantum Detector Tomography, i.e., the reconstruction of a Positive-Operator Valued Measure (POVM) describing the given quantum measurement device. If the measurement device is affected only by an invertible classical noise, it is possible to correct the outcome statistics of future experiments performed on the same device. To support the practical applicability of this scheme for near-te…
A quantum multimeter is a programmable device that can implement measurements of different observables depending on the programming quantum state inserted into it. The advantage of this arrangement over a single purpose device is in its versatility: one can realize various measurements simply by changing the programming state. The classical manipulation of measurement output data is known as post-processing. In this work we study the post-processing assisted quantum programming, which is a protocol where quantum programming and classical post-processing are combined. We provide examples showin…
Next Generation Artificial Intelligence Research Center (AI Center), Graduate School of Information Science and Technology, The University of Tokyo（东京大学信息科学与技术研究生院下一代人工智能研究中心（人工智能中心））；Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）
Current technologies in quantum-based communications bring a new integration of quantum data with classical data for hybrid processing. However, the frameworks of these technologies are restricted to a single classical or quantum task, which limits their flexibility in near-term applications. We propose a quantum reservoir processor to harness quantum dynamics in computational tasks requiring both classical and quantum inputs. This analog processor comprises a network of quantum dots in which quantum data is incident to the network and classical data is encoded via a coherent field exciting th…
The long-standing problem of quantum information processing is to remove the classical channel from quantum communication. Introducing a new information processing technique, it is discussed that both insecure and secure quantum communications are possible without the requirement of classical channel.
We define a summoning task to require propagating an unknown quantum state to a point in space-time belonging to a set determined by classical inputs at points in space-time. We consider the classical analogue, in which a known classical state must be returned at precisely one allowed point. We show that, when the inputs are unconstrained, any summoning task that is possible in the classical case is also possible in the quantum case.
Reservoir computing is a powerful machine learning paradigm for online time series processing. It has reached state-of-the-art performance in tasks such as chaotic time series prediction and continuous speech recognition thanks to its unique combination of high computational power and low training cost which sets it aside from alternatives such as traditionally trained recurrent neural networks, and furthermore is amenable to implementations in dedicated hardware, potentially leading to extremely compact and efficient reservoir computers. Recently the use of random quantum systems has been pro…
Accurate information processing is crucial both in technology and in nature. To achieve it, any information processing system needs an initial supply of resources away from thermal equilibrium. Here we establish a fundamental limit on the accuracy achievable with a given amount of nonequilibrium resources. The limit applies to arbitrary information processing tasks and arbitrary information processing systems subject to the laws of quantum mechanics. It is easily computable and is expressed in terms of an entropic quantity, which we name reverse entropy, associated to a time reversal of the in…
Based on a multimode multilevel Jaynes-Cummings model and multiphoton resonance theory, a set of universal two- and three-qubit gates, namely the iSWAP and the Fredkin gates, has been realized where dual-rail qubits are encoded in cavities. In this way the information has been stored in cavities and the off-resonant atomic levels have been eliminated by the semi-classical theory of an effective two-level Hamiltonian. A further semi-classical model, namely the spin-$J$ model, has been introduced so that a complete population inversion for levels of interest has been achieved and periodic multil…
Image processing on quantum platform is a hot topic for researchers now a day. Inspired from the idea of quantum physics, researchers are trying to shift their focus from classical image processing towards quantum image processing.This paper starts with a brief review of the principles which underlie quantum computing, and also deals with some of the basics of qubits and quantum computing.Then this paper starts to deal with some different methods of image storage, representation and retrieval in a quantum system.This paper also describes the advantages of using those methods in quantum systems…
A model of quantum noisy channel with input encoding by a classical random vector is described. An equation of optimality is derived to determine a complete set of wave functions describing quantum decodings based on quasi-measurements maximizing the classical amount of transmitted information. A solution of this equation is found for the Gaussian multimode case with input Gaussian distribution. It is described by the overcomplete family of coherent vectors describing an optimal quasimeasurement of the canonical annihilation amplitudes in the output Hilbert space. It is found that the optimal …
Quantum and classical processing with photonic quantum machine learning
Center for Theoretical Physics of the Polish Academy of Sciences（波兰科学院理论物理中心）；Institute of Experimental Physics, Faculty of Physics, University of Warsaw（华沙大学物理学院实验物理研究所）；Institute of Physics of the Polish Academy of Sciences（波兰科学院物理研究所）；Quandela
Entanglement between quantum and classical objects is of special interest in the context of fundamental studies of quantum mechanics and potential applications to quantum information processing. In quantum optics, single photons are treated as light quanta while coherent states are considered the most classical among all pure states. Recently, entanglement between a single photon and a coherent state in a free-traveling field was identified to be a useful resource for optical quantum information processing. However, it was pointed out to be extremely difficult to generate such states since it …
This paper presents a number of problems concerning the practical (real) implementation of the techniques known as Quantum Image Processing. The most serious problem is the recovery of the outcomes after the quantum measurement, which will be demonstrated in this work that is equivalent to a noise measurement, and it is not considered in the literature on the subject. It is noteworthy that this is due to several factors: 1) a classical algorithm that uses Dirac's notation and then it is coded in MATLAB does not constitute a quantum algorithm, 2) the literature emphasizes the internal represent…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such as entanglement. Recently, Dale, Jennings, and Rudolph negated the question by showing that a randomness processing, quantum Bernoulli factory, using quantum coherence, is strictly more powerful than the one with classical mechanics. In this Letter, focusing on the same scenario, we propose a theoretical protocol that is classically impossible but can be im…
Quantum computing (QC) offers a new computing paradigm that has the potential to provide significant speedups over classical computing. Each additional qubit doubles the size of the computational state space available to a quantum algorithm. Such exponentially expanding reach underlies QC's power, but at the same time puts demanding requirements on the quantum processing units (QPU) hardware. On the other hand, purely classical simulations of quantum circuits on either central processing unit (CPU) or graphics processing unit (GPU) scale poorly as they quickly become bottlenecked by runtime an…
We show that it is possible to generate photons in nonclassical states from a metal-dielectric interface using quantum emitters on the interface. The photons emitted into the surface plasmon mode from the initially excited emitters radiate out in free space in a cone-shaped geometry. When detected at two detectors, these photons exhibit anti-coalescence, a clear signature of nonclassicality. Such a system can also be employed as a building block for a distributed quantum network. We further show that it is indeed feasible to implement our model using available technology.
