Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

A Mathematical Theory of NMR Quantum Computations

Tetsuro Nishino

Published Jan 1, 2002• 1 citation
Publisher
DOI
10.1007/978-4-431-66979-1_33

Related papers

Progress in Compensating Pulse Sequences for Quantum Computation

J. True Merrill, Kenneth R. Brown

This chapter examines a number of techniques for handling unwanted control errors, including amplitude errors, timing errors, and frequency errors in the control field. The chapter discusses the common principles used to develop compensating pulse sequences. It provides a framework in which to develop new sequences, which will be of use to both quantum computation and coherent atomic and molecular spectroscopy. The chapter focuses on a model one-qubit nuclear-magnetic resonance (NMR) quantum computer, which serves as a relevant example of a system where coherent control is possible. Several models for errors in the controls of a one-qubit NMR quantum computer are considered. Several aspects of the theory of Lie groups are discussed with emphasis on conceptual clarity over mathematical rigor. The chapter studies pulse sequences that compensate single-qubit operations.

Advances in chemical physics•Feb 14, 2014•71 citations

Quantum Computation with NMR

Jonathan A. Jones

WORLD SCIENTIFIC eBooks•Jan 1, 2001•2 citations

Ensemble quantum computing by NMR spectroscopy

David G. Cory, Amr F. Fahmy, Timothy F. Havel

A quantum computer (QC) can operate in parallel on all its possible inputs at once, but the amount of information that can be extracted from the result is limited by the phenomenon of wave function collapse. We present a new computational model, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof. Such an expectation value QC can solve nondeterministic polynomial-time complete problems in polynomial time. This observation is significant precisely because the computational model can be realized, to a certain extent, by NMR spectroscopy on macroscopic ensembles of quantum spins, namely molecules in a test tube. This is made possible by identifying a manifold of statistical spin states, called pseudo-pure states, the mathematical description of which is isomorphic to that of an isolated spin system. The result is a novel NMR computer that can be programmed much like a QC, but in other respects more closely resembles a DNA computer. Most notably, when applied to intractable combinatorial problems, an NMR computer can use an amount of sample, rather than time, which grows exponentially with the size of the problem. Although NMR computers will be limited by current technology to exhaustive searches over only 15 to 20 bits, searches over as much as 50 bits are in principle possible, and more advanced algorithms could greatly extend the range of applicability of such machines.

Proceedings of the National Academy of Sciences•Mar 4, 1997•956 citations

NMR Quantum Computation

Jonathan A. Jones

ChemInform•Jul 17, 2001•0 citations

NMR quantum computation

Jonathan A. Jones

arXiv:quant-ph/0009002•Progress in Nuclear Magnetic Resonance Spectroscopy•Jun 1, 2001•181 citations

Quantum Algorithms and Mathematical Representation of Bio-molecular Solutions for the Hitting-set Problem on a Quantum Computer

Weng-Long Chang, Ting-Ting Ren, Mang Feng +6 more

In this paper, it is demonstrated that quantum implementation of bio-molecular solutions to compute the number of elements in each hitting-set in an instance of the hitting-set problem could be considered as the oracle work in Grover's algorithm, i.e., the target state labeling, preceding Grover's searching steps. Finally, for testing our theory, a three-qubit nuclear magnetic resonance (NMR) experiment of solving the simplest hitting-set problem is performed.

International Conference on Computational Aspects of Social Networks (CASoN)•Sep 1, 2010•0 citations
This chapter examines a number of techniques for handling unwanted control errors, including amplitude errors, timing errors, and frequency errors in the control field. The chapter discusses the common principles used to develop compensating pulse sequences. It provides a framework in which to develop new sequences, which will be of use to both quantum computation and coherent atomic and molecular spectroscopy. The chapter focuses on a model one-qubit nuclear-magnetic resonance (NMR) quantum computer, which serves as a relevant example of a system where coherent control is possible. Several models for errors in the controls of a one-qubit NMR quantum computer are considered. Several aspects of the theory of Lie groups are discussed with emphasis on conceptual clarity over mathematical rigor. The chapter studies pulse sequences that compensate single-qubit operations.
A quantum computer (QC) can operate in parallel on all its possible inputs at once, but the amount of information that can be extracted from the result is limited by the phenomenon of wave function collapse. We present a new computational model, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof. Such an expectation value QC can solve nondeterministic polynomial-time complete problems in polynomial time. This observation is significant precisely because the computational model can be realized, to a certain extent, by NMR spectroscopy on macroscopic ensembles of quantum spins, namely molecules in a test tube. This is made possible by identifying a manifold of statistical spin states, called pseudo-pure states, the mathematical description of which is isomorphic to that of an isolated spin system. The result is a novel NMR computer that can be programmed much like a QC, but in other respects more closely resembles a DNA computer. Most notably, when applied to intractable combinatorial problems, an NMR computer can use an amount of sample, rather than time, which grows exponentially with the size of the problem. Although NMR computers will be limited by current technology to exhaustive searches over only 15 to 20 bits, searches over as much as 50 bits are in principle possible, and more advanced algorithms could greatly extend the range of applicability of such machines.