Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance
arXiv:quant-ph/0503101 · doi:10.1063/1.1795674
Abstract
Quantum information processing has been effectively demonstrated on a small number of qubits by nuclear magnetic resonance. An important subroutine in any computing is the readout of the output. ``Spectral implementation'' originally suggested by Z.L. Madi, R. Bruschweiler and R.R. Ernst, [J. Chem. Phys. 109, 10603 (1999)], provides an elegant method of readout with the use of an extra `observer' qubit. At the end of computation, detection of the observer qubit provides the output via the multiplet structure of its spectrum. In "spectral implementation" by two-dimensional experiment the observer qubit retains the memory of input state during computation, thereby providing correlated information on input and output, in the same spectrum. "Spectral implementation" of Grover's search algorithm, approximate quantum counting, a modified version of Berstein-Vazirani problem, and Hogg's algorithm is demonstrated here in three and four-qubit systems.
arXiv comment39 pages,11 figures
References in corpus (18)
- Quantum Mechanics helps in searching for a needle in a haystack
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Tight bounds on quantum searching
- Experimental realization of a quantum algorithm
- 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
- Approximate Quantum Cloning with Nuclear Magnetic Resonance
- 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
- Use of Quadrupolar Nuclei for Quantum Information processing by Nuclear Magnetic Resonance: Implementation of a Quantum Algorithm
- Implementation of a quantum algorithm to solve Bernstein-Vazirani's parity problem without entanglement on an ensemble quantum computer
- Efficient Quantum State Tomography for Quantum Information Processing using a two-dimensional Fourier Transform Technique
- Experimental Implementation of Hogg's Algorithm on a Three-Quantum-bit NMR Quantum Computer
- Quantum Entanglement and Quantum Computational Algorithms
- Search for optimum labeling schemes in qubit systems for Quantum Information processing by NMR
- "Spectral Implementation" for creating a labeled pseudo-pure state and the Bernstein-Vazirani's algorithm in a four-qubit nuclear magnetic resonance quantum processor
- Nuclear magnetic resonance implementation of the Deutsch-Jozsa algorithm using different initial states