Implementation of a quantum algorithm to solve Bernstein-Vazirani's parity problem without entanglement on an ensemble quantum computer

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.

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