Implementation of a quantum algorithm to solve Bernstein-Vazirani's parity problem without entanglement on an ensemble quantum computer
arXiv:quant-ph/0012114 · doi:10.1103/PhysRevA.64.042306
Abstract
Bernstein and Varizani have given the first quantum algorithm to solve parity problem in which a strong violation of the classical imformation theoritic bound comes about. In this paper, we refine this algorithm with fewer resource and implement a two qubits algorithm in a single query on an ensemble quantum computer for the first time.
References in corpus (18)
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Algorithms Revisited
- Experimental realization of a quantum algorithm
- Separability of very noisy mixed states and implications for NMR quantum computing
- Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
- Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
- Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer
- Sophisticated quantum search without entanglement
- Quantum Algorithms: Entanglement Enhanced Information Processing
- Experimental Realization of an Order-Finding Algorithm with an NMR Quantum Computer
- Quantum search without entanglement
- Implementation of a three-quantum-bit search algorithm
- Implementing quantum logic operations, pseudo-pure states and the Deutsch-Jozsa algorithm using non-commuting selective pulses in NMR
- Approximate quantum counting on an NMR ensemble quantum computer
- Single quantum querying of a database
- Implementation of the refined Deutsch-Jozsa algorithn on a 3-bit NMR quantum computer
- NMR quantum computation with indirectly coupled gates
- Pulse Sequences for NMR Quantum Computers: How to Manipulate Nuclear Spins While Freezing the Motion of Coupled Neighbours
Cited by in corpus (17)
- Experimental realization of quantum games on a quantum computer
- Experimental Implementation of the Quantum Random-Walk Algorithm
- Quantum Computing with NMR
- Computational speed-up in a single qudit NMR quantum information processor
- Computational speed-up with a single qudit
- Optical implementation of Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms in eight dimensions
- Entanglement and coherence in Bernstein-Vazirani algorithm
- Quantum Discord for Investigating Quantum Correlations without Entanglement in Solids
- Towards Large-Scale Quantum Computation
- "Spectral Implementation" for creating a labeled pseudo-pure state and the Bernstein-Vazirani's algorithm in a four-qubit nuclear magnetic resonance quantum processor
- Optical implementations, oracle equivalence, and the Bernstein-Vazirani algorithm
- Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance
- Coherence dynamics in quantum algorithm for linear systems of equations
- Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits
- Quantum algorithm for learning secret strings and its experimental demonstration
- Coherence and entanglement dynamics in Shor's algorithm
- A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks