Related papers: Optical implementations, oracle equivalence, and t…
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…
Classical optics can be used to efficiently implement certain quantum information processing tasks with a high degree of control, for example, one-dimensional quantum walks through the space of orbital angular momentum of light directed by…
We propose encoding multiple qubits inside ions in existing trapped-ion quantum computers to access more qubits and to simplify circuits implementing standard algorithms. By using such `virtual' qubits, some inter-ion gates can be replaced…
Executing quantum algorithms using Majorana zero modes - a major milestone for the field of topological quantum computing - requires a platform that can be scaled to large quantum registers, can be controlled in real time and space, and a…
Quantum cloning is an essential operation in quantum information and quantum computing. Similar to the `copy' operation in classical computing, the cloning of flying bits for further processing from the solid-state quantum bits in storage…
We compare several optical implementations of phase-covariant cloning machines. The experiments are based on copying of the polarization state of a single photon in bulk optics by special unbalanced beam splitter or by balanced beam…
We present here a classical optics device based on an imaging architecture as analogy of a quantum system where the violation of the Bell inequality can be evidenced. In our case, the two qbits entangled state needed to obtain non classical…
Quantum algorithms theoretically outperform classical algorithms in solving problems of increasing size, but computational errors must be kept to a minimum to realize this potential. Despite the development of increasingly capable quantum…
Quantum computing has brought a paradigm change in computer science, where non-classical technologies have promised to outperform their classical counterpart. Such an advantage was only demonstrated for tasks without practical applications,…
We present a new method to perform variation after projection in many-body systems on quantum computers that does not require performing explicit projection. The technique employs the notion of ``oracle'', generally used in quantum search…
Quantum computing has attracted much attention in recent decades, since it is believed to solve certain problems substantially faster than traditional computing methods. Theoretically, such an advance can be obtained by networks of the…
We present a zero-crossings counting problem that is a generalization of the Bernstein-Vazirani problem. The goal of this problem is to count the number of zero-crossings (or sign changes) in a special type of sequence S, whose definition…
Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two $d$-dimensional quantum systems or qudits for the case in which $d$ is equal to $2^n$, $n=1,2,...$ . This allows one to classify a certain…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…
A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms…
The first quantum technologies to solve computational problems that are beyond the capabilities of classical computers are likely to be devices that exploit characteristics inherent to a particular physical system, to tackle a bespoke…
We construct a hybrid quantum-classical approach for the $K$-Nearest Neighbour algorithm, where the information is embedded in a phase-distributed multimode coherent state with the assistance of a single photon. The task of finding the…
We propose a probabilistic quantum algorithm that decides whether a monochrome picture matches a given template (or one out of a set of templates). As a major advantage to classical pattern recognition, the algorithm just requires a few…
The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum…
We present a classical algorithm for approximating the expectation values of observables in linear-optical circuits with arbitrary product input states, achieving additive-error accuracy. This result indicates that current applications of…