Related papers: A Generalisation of the Phase Kick-Back
Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in…
The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity…
Quantum machine learning seeks to exploit the underlying nature of a quantum computer to enhance machine learning techniques. A particular framework uses the quantum property of superposition to store sets of parameters, thereby creating an…
In the rapidly growing area of quantum information, the Deutsch algorithm is ubiquitous and, in most cases, the first one to be introduced to any student of this relatively new field of research. The reason for this historical relevance…
We study a new method - called Schrodingerisation introduced in [Jin, Liu, Yu, arXiv: 2212.13969] - for solving general linear partial differential equations with quantum simulation. This method converts linear partial differential…
The relation that exists in quantum mechanics among action variables, angle variables and the phases of quantum states is clarified, by referring to the system of a generalized oscillator. As a by-product, quantum-mechanical meaning of the…
We apply the Wigner function formalism from quantum optics via two approaches, Wootters' discrete Wigner function and the generalized Wigner function, to detect quantum phase transitions in critical spin-$\tfrac{1}{2}$ systems. We develop a…
A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of…
A generalized Feynman-Kac formula based on the Wiener measure is presented. Within the setting of a quantum particle in an electromagnetic field it yields the standard Feynman-Kac formula for the corresponding Schr\"odinger semigroup. In…
We derive a quantum version of the classical-optics Wiener-Khintchine theorem within the framework of detection of phase-space displacements with a suitably designed quantum ruler. A phase-pace based quantum mutual coherence function is…
We implemented the refined Deutsch-Jozsa algorithm on a 3-bit nuclear magnetic resonance quantum computer, which is the meaningful test of quantum parallelism because qubits are entangled. All of the balanced and constant functions were…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
We present a generally covariant approach to quantum mechanics in which generalized positions, momenta and time variables are treated as coordinates on a fundamental "phase-spacetime." We show that this covariant starting point makes…
We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon…
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…
Quantum correlations have been pointed out as the most likely source of the speed-up in quantum computation. Here we analyzed the presence of quantum correlations in the implementation of Deutsch-Jozsa algorithm running in the DQC1 and DQCp…
We propose a physical scheme for implementing the Deutsch-Jozsa algorithm using atomic ensembles and optical devices. The scheme has inherent fault tolerance to the realistic noise and efficient scaling with the number of ensembles for some…
A general quantum search algorithm aims to evolve a quantum system from a known source state $|s\rangle$ to an unknown target state $|t\rangle$. It uses a diffusion operator $D_{s}$ having source state as one of its eigenstates and $I_{t}$,…
A general approach for transitionless quantum driving in open quantum systems is introduced. Under the assumption of adiabatic evolution for time-local master equations, we derive the generalized transitionless Lindbladian required to…
A general semiclassical method in phase space based on the final value representation of the Wigner function is considered that bypasses caustics and the need to root-search for classical trajectories. We demonstrate its potential by…