Demonstrating quantum algorithm acceleration with NMR quantum computer
arXiv:quant-ph/0405050 · doi:10.1103/PhysRevA.70.052319
Abstract
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this by taking the two-qubit Grover's algorithm implemented in NMR quantum computation, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for a self-contained quantum algorithm.
6 pages, revtex, 1 table, experimental details added, 1 figure added
References in corpus (11)
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Good Quantum Error-Correcting Codes Exist
- Decoherence Free Subspaces for Quantum Computation
- Holonomic Quantum Computation
- Time Optimal Control in Spin Systems
- Efficient decomposition of quantum gates
- Optimal multiqubit operations for Josephson charge qubits
- Realization of Arbitrary Gates in Holonomic Quantum Computation
- Implementing Shor's algorithm on Josephson Charge Qubits
- Exact Solutions of Holonomic Quantum Computation