Enhancement of non-Stabilizerness within Indefinite Causal Order
arXiv:2311.15494 · doi:10.1103/PhysRevA.109.062428
Abstract
In quantum computing, the nonstabilizerness of quantum operations is crucial for understanding and quantifying quantum speedups. In this study, we explore the phenomena of nonstabilizerness of the quantum SWITCH, a novel structure that allows quantum states to pass through operations in a superposition of different orders, outperforming traditional circuits in numerous tasks. To assess its nonstabilizerness, we propose the magic resource capacity of a quantum process to quantitatively examine the nonstabilizerness of general quantum transformations. We find that the completely stabilizer-preserving operations, which cannot generate magic states under standard conditions, can be transformed to do so when processed by the quantum SWITCH. Furthermore, when considering the impact of noise, although the nonstabilizerness of each path may be annihilated, their superposition could still preserve the overall nonstabilizerness. These findings reveal the unique properties of the quantum SWITCH and open avenues in research on nonstabilizer resources of general quantum architecture.
6+7 pages, 7 figures
References in corpus (46)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum computational advantage using photons
- Quantum Teleportation is a Universal Computational Primitive
- Improved Simulation of Stabilizer Circuits
- Quantum Resource Theories
- Quantum Computing with Very Noisy Devices
- Strong quantum computational advantage using a superconducting quantum processor
- Quantum correlations with no causal order
- Quantum computations without definite causal structure
- The Resource Theory of Stabilizer Computation
- Positive Wigner functions render classical simulation of quantum computation efficient
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Negative Quasi-Probability as a Resource for Quantum Computation
- Methodology for quantum logic gate constructions
- Hudson's Theorem for finite-dimensional quantum systems
- Trading classical and quantum computational resources
- Stabilizer Rényi entropy
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Experimental Verification of an Indefinite Causal Order
- Enhanced communication with the assistance of indefinite causal order
- Indefinite Causal Order in a Quantum Switch
- Exponential Communication Complexity Advantage from Quantum Superposition of the Direction of Communication
- Quantum Metrology with Indefinite Causal Order
- On the capacities of bipartite Hamiltonians and unitary gates
- Experimental transmission of quantum information using a superposition of causal orders
- Quantifying the magic of quantum channels
- Quantifying nonstabilizerness of matrix product states
- Quantum Refrigeration with Indefinite Causal Order
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- Quantifying magic for multi-qubit operations
- Scalable measures of magic resource for quantum computers
- Robustness of Magic and Symmetries of the Stabiliser Polytope
- Measuring magic on a quantum processor
- Efficiently computable bounds for magic state distillation
- Optimal Entanglement Generation from Quantum Operations
- Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
- Resource theories of communication
- Non-negative Wigner functions in prime dimensions
- Experimentally feasible computational advantage from quantum superposition of gate orders
- Resource theory of asymmetric distinguishability
- Quantum interference as a resource for quantum speedup
- Generating random quantum channels
- Quantification and manipulation of magic states
- Lower bound for the T count via unitary stabilizer nullity
- Quantum Entropy and Central Limit Theorem
- Quantifying dynamical magic with completely stabilizer preserving operations as free