Related Experiment Video
Updated: Jul 6, 2025

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
Published on: May 30, 2014
Encoding a magic state with beyond break-even fidelity
Riddhi S Gupta1,2, Neereja Sundaresan1, Thomas Alexander1
1IBM Quantum, T. J. Watson Research Center, Yorktown Heights, NY, USA.
Abstract:
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise1-8. We can complete a universal set of logic gates by producing special resources called magic states9-11. It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those that can be prepared using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing12, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Moreover, we show that the yield of magic states can be increased using adaptive circuits, in which the circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability needed for many error-correction subroutines. We believe that our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.
Related Concept Videos
Free Energy Changes for Nonstandard States
where R is the gas constant (8.314 J/K·mol), T is the absolute temperature in kelvin, and Q is the reaction quotient. This equation may be used to predict the spontaneity of a process under any given set of conditions.
Reaction Quotient...
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
State Space Representation
Consider an RLC circuit, a...
State Space to Transfer Function
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
Propagation of Uncertainty from Random Error
Bulk Modulus

