Trapped-ion quantum computing: Progress and challenges
CD Bruzewicz, J Chiaverini, R McConnell… - Applied Physics …, 2019 - pubs.aip.org
Trapped ions are among the most promising systems for practical quantum computing (QC).
The basic requirements for universal QC have all been demonstrated with ions, and …
The basic requirements for universal QC have all been demonstrated with ions, and …
Quantum computing with NMR
JA Jones - Progress in nuclear magnetic resonance spectroscopy, 2011 - Elsevier
Quantum computers [1–4] are explicitly quantum mechanical systems that use phenomena
such as superposition and entanglement to perform computational tasks more efficiently …
such as superposition and entanglement to perform computational tasks more efficiently …
[HTML][HTML] Gate set tomography
Gate set tomography (GST) is a protocol for detailed, predictive characterization of logic
operations (gates) on quantum computing processors. Early versions of GST emerged …
operations (gates) on quantum computing processors. Early versions of GST emerged …
Characterizing large-scale quantum computers via cycle benchmarking
A Erhard, JJ Wallman, L Postler, M Meth… - Nature …, 2019 - nature.com
Quantum computers promise to solve certain problems more efficiently than their digital
counterparts. A major challenge towards practically useful quantum computing is …
counterparts. A major challenge towards practically useful quantum computing is …
Quantum stochastic processes and quantum non-Markovian phenomena
The field of classical stochastic processes forms a major branch of mathematics. Stochastic
processes are, of course, also very well studied in biology, chemistry, ecology, geology …
processes are, of course, also very well studied in biology, chemistry, ecology, geology …
Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
R Blume-Kohout, JK Gamble, E Nielsen… - Nature …, 2017 - nature.com
Quantum information processors promise fast algorithms for problems inaccessible to
classical computers. But since qubits are noisy and error-prone, they will depend on fault …
classical computers. But since qubits are noisy and error-prone, they will depend on fault …
Scalable and robust randomized benchmarking of quantum processes
E Magesan, JM Gambetta, J Emerson - Physical review letters, 2011 - APS
In this Letter we propose a fully scalable randomized benchmarking protocol for quantum
information processors. We prove that the protocol provides an efficient and reliable …
information processors. We prove that the protocol provides an efficient and reliable …
Randomized benchmarking of quantum gates
E Knill, D Leibfried, R Reichle, J Britton… - Physical Review A …, 2008 - APS
A key requirement for scalable quantum computing is that elementary quantum gates can be
implemented with sufficiently low error. One method for determining the error behavior of a …
implemented with sufficiently low error. One method for determining the error behavior of a …
Experimental one-way quantum computing
Standard quantum computation is based on sequences of unitary quantum logic gates that
process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is …
process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is …
Experimental realization of nonadiabatic holonomic quantum computation
Because of its geometric nature, holonomic quantum computation is fault tolerant against
certain types of control errors. Although proposed more than a decade ago, the experimental …
certain types of control errors. Although proposed more than a decade ago, the experimental …