Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
arXiv:2109.13018 · doi:10.1103/PhysRevLett.128.210502
Abstract
Quantum resource theories are a powerful framework to characterize and quantify relevant quantum phenomena and identify processes that optimize their use for different tasks. Here, we define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. In contrast to previous literature, our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation. Particularly, we use the Gottesman-Kitaev-Preskill code to represent multi-qubit states and consider the resource theory for the Wigner negativity. Our techniques are useful to find resource lower bounds for different applications as state conversion and general unitary synthesis, in which measurements, auxiliary states, and classical feed-forward are allowed. The analytical expression of our magic measure allows us to extend current analysis limited to small dimensions, easily addressing systems of up to 12 qubits.
References in corpus (10)
- Surface codes: Towards practical large-scale quantum computation
- Restrictions on Transversal Encoded Quantum Gate Sets
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Stabilizer Rényi entropy
- Novel constructions for the fault-tolerant Toffoli gate
- Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
- Wigner function negativity and contextuality in quantum computation on rebits
- Catalysis and activation of magic states in fault tolerant architectures
- Discrete Wigner Formalism for Qubits and Non-Contextuality of Clifford Gates on Qubit Stabilizer States
- Constraints on magic state protocols from the statistical mechanics of Wigner negativity
Cited by in corpus (23)
- Quantifying nonstabilizerness of matrix product states
- Stabilizer entropies and nonstabilizerness monotones
- Measuring magic on a quantum processor
- Scalable measures of magic resource for quantum computers
- Stabilizer entropies are monotones for magic-state resource theory
- Magic-state resource theory for the ground state of the transverse-field Ising model
- Nonstabilizerness determining the hardness of direct fidelity estimation
- Learning efficient decoders for quasi-chaotic quantum scramblers
- Quantifying non-stabilizerness via information scrambling
- Quantifying dynamical magic with completely stabilizer preserving operations as free
- Handbook for Quantifying Robustness of Magic
- Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding
- Sufficient condition for universal quantum computation using bosonic circuits
- Limitations of Classically-Simulable Measurements for Quantum State Discrimination
- Maximal Magic for Two-qubit States
- Clifford operations and homological codes for rotors and oscillators
- Classical simulation and quantum resource theory of non-Gaussian optics
- A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
- Faster computation of nonstabilizerness
- Invested and Potential Magic Resources in Measurement-Based Quantum Computation
- Grand Unification of All Discrete Wigner Functions on Phase Space
- Tessellation codes: encoded quantum gates by geometric rotation
- High-expressibility Quantum Neural Networks using only classical resources