Universal Quantum Computation with ideal Clifford gates and noisy ancillas

Abstract

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0⟩$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\rho$, which should be regarded as a parameter of the model. Our goal is to determine for which $\rho$ universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of $\rho$ and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain "magic" directions. If the polarization of $\rho$ along a magic direction exceeds a threshold value (about 65%), the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed.

15 pages, 4 figures, revtex4

References in corpus (5)

• String-net condensation: A physical mechanism for topological phases
• Criticality, the area law, and the computational power of PEPS
• Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
• Renormalization group transformations on quantum states
• Quantum phase transitions in matrix product systems

Cited by in corpus (952)

• Surface codes: Towards practical large-scale quantum computation
• New directions in the pursuit of Majorana fermions in solid state systems
• A Quantum Engineer's Guide to Superconducting Qubits
• Non-Abelian statistics and topological quantum information processing in 1D wire networks
• Quantum computational chemistry
• Quantum Error Correction for Quantum Memories
• Quantum Resource Theories
• Majorana Zero Modes and Topological Quantum Computation
• Measurement-based quantum computation
• Randomized Benchmarking of Quantum Gates
• Realizing Majorana zero modes in superconductor-semiconductor heterostructures
• Fault-tolerant quantum computation with high threshold in two dimensions
• Elucidating Reaction Mechanisms on Quantum Computers
• Topological Quantum Distillation
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Topological fault-tolerance in cluster state quantum computation
• Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
• Contextuality supplies the magic for quantum computation
• Building logical qubits in a superconducting quantum computing system
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• Toward the first quantum simulation with quantum speedup
• Noise tailoring for scalable quantum computation via randomized compiling
• The Resource Theory of Stabilizer Computation
• High threshold universal quantum computation on the surface code
• Direct Fidelity Estimation from Few Pauli Measurements
• Characterizing Quantum Gates via Randomized Benchmarking
• Restrictions on Transversal Encoded Quantum Gate Sets
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Real-time quantum error correction beyond break-even
• Experimental Quantum Computations on a Topologically Encoded Qubit
• Application of a resource theory for magic states to fault-tolerant quantum computing
• A fault-tolerant one-way quantum computer
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Dynamical purification phase transitions induced by quantum measurements
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Negative Quasi-Probability as a Resource for Quantum Computation
• Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
• Majorana Fermions and Topology in Superconductors
• Magic state distillation with low overhead
• Quantum Error Correction: An Introductory Guide
• Flux-controlled quantum computation with Majorana fermions
• Coulomb-assisted braiding of Majorana fermions in a Josephson junction array
• How to quantify coherence: Distinguishing speakable and unspeakable notions
• Topological Quantum Computation Based on Chiral Majorana Fermions
• Entanglement purification and quantum error correction
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Practical characterization of quantum devices without tomography
• Demonstration of fault-tolerant universal quantum gate operations
• Trading classical and quantum computational resources
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Building a fault-tolerant quantum computer using concatenated cat codes
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Low Depth Quantum Simulation of Electronic Structure
• The XZZX Surface Code
• OpenQASM 3: A broader and deeper quantum assembly language
• Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Two-dimensional platform for networks of Majorana bound states
• Robust dynamical decoupling
• Quantum memories at finite temperature
• A Short Introduction to Topological Quantum Computation
• Fixed-point quantum search with an optimal number of queries
• Automated optimization of large quantum circuits with continuous parameters
• Virtual Distillation for Quantum Error Mitigation
• Controlling non-Abelian statistics of Majorana fermions on Majorana dimer lattices
• Single-qubit-gate error below 10^-4 in a trapped ion
• Magic State Distillation: Not as Costly as You Think
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Layered architecture for quantum computing
• Composite Majorana Fermion Wavefunctions in Nanowires
• Novel constructions for the fault-tolerant Toffoli gate
• Fault-tolerant quantum computation against biased noise
• Kochen-Specker Contextuality
• Protected gates for superconducting qubits
• Loss tolerance in one-way quantum computation via counterfactual error correction
• Superconducting Nanocircuits for Topologically Protected Qubits
• Bias-preserving gates with stabilized cat qubits
• On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
• Convex resource theory of non-Gaussianity
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Anyonic interferometry without anyons: How a flux qubit can read out a topological qubit
• Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes
• Quantum computing with rotation-symmetric bosonic codes
• Assessing the progress of trapped-ion processors towards fault-tolerant quantum computation
• Fault tolerant quantum computation with very high threshold for loss errors
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Quantum computation with realistic magic state factories
• Universal gates based on targeted phase shifts in a 3D neutral atom array
• Many-body quantum magic
• Classification of topologically protected gates for local stabilizer codes
• Top-transmon: hybrid superconducting qubit for parity-protected quantum computation
• Performing Quantum Computing Experiments in the Cloud
• Quantum information processing with bosonic qubits in circuit QED
• Contextuality as a resource for models of quantum computation on qubits
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quantum advantage with noisy shallow circuits in 3D
• Towards realistic implementations of a Majorana surface code
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Improved magic states distillation for quantum universality
• Wigner function negativity and contextuality in quantum computation on rebits
• Operational Advantage of Quantum Resources in Subchannel Discrimination
• Universal transversal gates with color codes - a simplified approach
• Entangling logical qubits with lattice surgery
• Classicality in discrete Wigner functions
• Roadmap to Majorana surface codes
• Experimental and materials considerations for the topological superconducting state in electron and hole doped semiconductors: searching for non-Abelian Majorana modes in 1D nanowires and 2D heterostructures
• Fault-tolerant thresholds for quantum error correction with the surface code
• Blind topological measurement-based quantum computation
• Universal quantum computation on a semiconductor quantum wire network
• Lower bounds on the non-Clifford resources for quantum computations
• Multilevel distillation of magic states for quantum computing
• Towards Universal Topological Quantum Computation in the $\nu =5/2$ Fractional Quantum Hall State
• Quantifying the magic of quantum channels
• Quantifying nonstabilizerness of matrix product states
• On the robustness of bucket brigade quantum RAM
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Measurement-induced entanglement transitions in many-body localized systems
• Stabilizer entropies and nonstabilizerness monotones
• Tutorial: Gate-based superconducting quantum computing
• Quantifying magic for multi-qubit operations
• Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
• Contextuality and Wigner function negativity in qubit quantum computation
• Topological quantum buses: coherent quantum information transfer between topological and conventional qubits
• Majorana nanowires for topological quantum computation
• Error-transparent operations on a logical qubit protected by quantum error correction
• Scalable measures of magic resource for quantum computers
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Encoding a magic state with beyond break-even fidelity
• Qudit versions of the qubit "pi-over-eight" gate
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Protected quantum computing: Interleaving gate operations with dynamical decoupling sequences
• Foliated Quantum Codes
• Fault-tolerant logical gates in quantum error-correcting codes
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Quantum Measurements and Gates by Code Deformation
• Simulation of non-Abelian braiding in Majorana time crystals
• Hadamard-free circuits expose the structure of the Clifford group
• Fault-tolerant error correction with the gauge color code
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
• Qutrit Magic State Distillation
• Gaussian quantum resource theories
• Surface code implementation of block code state distillation
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• One-Shot Operational Quantum Resource Theory
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• Conformal field theories are magical
• Quantum accuracy threshold for concatenated distance-3 codes
• No-Go Theorems for Quantum Resource Purification
• Efficiently computable bounds for magic state distillation
• Convex geometry of quantum resource quantification
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
• Using concatenated quantum codes for universal fault-tolerant quantum gates
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• The surface code with a twist
• Topological and holonomic quantum computation based on second-order topological superconductors
• A magic state's fidelity can be superior to the operations that created it
• Encoding an oscillator into many oscillators
• Interactive Proofs For Quantum Computations
• Approximate Quantum Fourier Transform with $O(n\log (n))$ T gates
• Architectural design for a topological cluster state quantum computer
• Stabilizer entropies are monotones for magic-state resource theory
• Biology and medicine in the landscape of quantum advantages
• Error-corrected gates on an encoded qubit
• Experimental evidence of non-classical brain functions
• Continuous symmetries and approximate quantum error correction
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Non-adiabatic processes in Majorana qubit systems
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Catalysis and activation of magic states in fault tolerant architectures
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Efficient Decoders for Qudit Topological Codes
• Scalable randomized benchmarking of non-Clifford gates
• Hardware for Dynamic Quantum Computing
• Requirements for fault-tolerant factoring on an atom-optics quantum computer
• Error mitigation for universal gates on encoded qubits
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• The ZX calculus is a language for surface code lattice surgery
• Fault-tolerant magic state preparation with flag qubits
• From Majorana Fermions to Topological Order
• A silicon-based surface code quantum computer
• How quickly can anyons be braided? Or: How I learned to stop worrying about diabatic errors and love the anyon
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Fault-tolerant quantum computing with color codes
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Parallel window decoding enables scalable fault tolerant quantum computation
• Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation
• A geometric protocol for a robust Majorana magic gate
• Nonstabilizerness via matrix product states in the Pauli basis
• Benchmarking one-shot distillation in general quantum resource theories
• Quantum Computing with Majorana Fermion Codes
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Universal fault-tolerant gates on concatenated stabilizer codes
• Quantum homomorphic encryption from quantum codes
• Clifford Gates by Code Deformation
• Flexible superconducting Nb transmission lines on thin film polyimide for quantum computing applications
• Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
• Measurement-only quantum computation with Majorana corner modes
• High threshold codes for neutral atom qubits with biased erasure errors
• Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis
• Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits
• Distinguishing Majorana bound states from localized Andreev bound states by interferometry
• Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation
• Quantum Computing with Parafermions
• Phase space simulation method for quantum computation with magic states on qubits
• Resource quality of a symmetry-protected topologically ordered phase for quantum computation
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Quantum computation via Floquet topological edge modes
• Measuring nonstabilizerness via multifractal flatness
• Measurement-based Quantum Communication
• Implementing arbitrary phase gates with Ising anyons
• Computational power of one- and two-dimensional dual-unitary quantum circuits
• Phase transition in magic with random quantum circuits
• Neural network decoder for topological color codes with circuit level noise
• Surface code compilation via edge-disjoint paths
• Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor
• Applying quantum algorithms to constraint satisfaction problems
• Quantum coding with low-depth random circuits
• Simulation of Qubit Quantum Circuits via Pauli Propagation
• Pauli Spectrum and Non-stabilizerness of Typical Quantum Many-Body States
• Magic spreading in random quantum circuits
• Anyon condensation and the color code
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Efficient quantum algorithms for stabilizer entropies
• Resources Required for Topological Quantum Factoring
• Efficient classical simulation of matchgate circuits with generalized inputs and measurements
• Measurement-Only Topological Quantum Computation via Tunable Interactions
• Fault-Tolerant Operation of a Quantum Error-Correction Code
• Quasi-Topological Phases of Matter and Topological Protection
• Dynamical Magic Transitions in Monitored Clifford+T Circuits
• A fast fault-tolerant decoder for qubit and qudit surface codes
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions
• A Photonic Implementation for the Topological Cluster State Quantum Computer
• Efficient synthesis of probabilistic quantum circuits with fallback
• Distillation with sublogarithmic overhead
• 2-D color code quantum computation
• Interacting non-Abelian anyons as Majorana fermions in the honeycomb lattice model
• Topological Phases of Inhomogeneous Superconductivity
• Logical blocks for fault-tolerant topological quantum computation
• Entanglement-assisted entanglement purification
• Distillation of multipartite entanglement by complementary stabilizer measurements
• Fundamental limitations on distillation of quantum channel resources
• On applications of quantum computing to plasma simulations
• Experimental magic state distillation for fault-tolerant quantum computing
• Shorter gate sequences for quantum computing by mixing unitaries
• Topologically protected quantum gates for computation with non-Abelian anyons in the Pfaffian quantum Hall state
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Three-dimensional color code thresholds via statistical-mechanical mapping
• Modeling quantum noise for efficient testing of fault-tolerant circuits
• A logical qubit in a linear array of semiconductor quantum dots
• Unifying gate-synthesis and magic state distillation
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Robust quantum compilation and circuit optimisation via energy minimisation
• On Optimality of CSS Codes for Transversal $T$
• Building a large-scale quantum computer with continuous-variable optical technologies
• Protected gates for topological quantum field theories
• Uniqueness of noncontextual models for stabilizer subtheories
• Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic Control of the Dispersive Shift: Experiment and Theory
• Minimally complex ion traps as modules for quantum communication and computing
• Catalysis of entanglement and other quantum resources
• A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
• Experimental Demonstration of Logical Magic State Distillation
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• Axiomatic and operational connections between the $l_1$-norm of coherence and negativity
• Majorana-based fermionic quantum computation
• Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
• Efficient Decoding of Topological Color Codes
• Practical experimental certification of computational quantum gates via twirling
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit
• Distilling one-qubit magic states into Toffoli states
• Constructions and Noise Threshold of Topological Subsystem Codes
• The Fibonacci scheme for fault-tolerant quantum computation
• Braiding Majorana zero modes using quantum dots
• Non-stabilizerness versus entanglement in matrix product states
• Overhead analysis of universal concatenated quantum codes
• Creation of Optical Cat and GKP States Using Shaped Free Electrons
• Quasiprobability representations of quantum mechanics with minimal negativity
• Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
• Quantification and manipulation of magic states
• Thresholds for universal concatenated quantum codes
• Probabilistic transformations of quantum resources
• Measurement-free preparation of grid states
• Efficient entanglement purification protocols for d-level systems
• From estimation of quantum probabilities to simulation of quantum circuits
• Stabilizer entropy dynamics after a quantum quench
• Cost-Reduced All-Gaussian Universality with the Gottesman-Kitaev-Preskill Code: Resource-Theoretic Approach to Cost Analysis
• Robust fault tolerance for continuous-variable cluster states with excess anti-squeezing
• Improved upper bounds on the stabilizer rank of magic states
• A hidden variable model for universal quantum computation with magic states on qubits
• Scaling and logic in the color code on a superconducting quantum processor
• Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
• Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Universal fault-tolerant measurement-based quantum computation
• Coupling and braiding Majorana bound states in networks defined in proximitized two-dimensional electron gases
• Block-encoding structured matrices for data input in quantum computing
• Transversal Clifford gates on folded surface codes
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Classification of engineered topological superconductors
• No-go theorems for quantum resource purification II: new approach and channel theory
• Floquet Majorana zero and $\pi$ modes in planar Josephson junctions
• Reducing the quantum computing overhead with complex gate distillation
• Semi-Clifford operations, structure of ${\mathcal{C}}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation
• Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
• Comparing the Overhead of Topological and Concatenated Quantum Error Correction
• Entanglement-magic separation in hybrid quantum circuits
• Critical behaviors of non-stabilizerness in quantum spin chains
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Augmenting Density Matrix Renormalization Group with Clifford Circuits
• Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Reducing the overhead for quantum computation when noise is biased
• Encoding qubits in multimode grid states
• Normal form for single-qutrit Clifford+T operators and synthesis of single-qutrit gates
• Lower bound for the T count via unitary stabilizer nullity
• Pseudomagic Quantum States
• Readout of Majorana parity states using a quantum dot
• The Power of Noisy Fermionic Quantum Computation
• All pure fermionic non-Gaussian states are magic states for matchgate computations
• Fault-tolerant interface between quantum memories and quantum processors
• Yu-Shiba-Rusinov qubit
• Secure Multi-party Quantum Computation with a Dishonest Majority
• Noise Thresholds for Higher Dimensional Systems using the Discrete Wigner Function
• On fault-tolerance with noisy and slow measurements
• Qutrit Magic State Distillation Tight in Some Directions
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Magic in generalized Rokhsar-Kivelson wavefunctions
• Error mitigation and quantum-assisted simulation in the error corrected regime
• Fault-tolerant gates on hypergraph product codes
• Partitioning qubits in hypergraph product codes to implement logical gates
• An efficient magic state approach to small angle rotations
• Quantum Circuits for Measuring Levin-Wen Operators
• Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
• Level Reduction and the Quantum Threshold Theorem
• T-count and T-depth of any multi-qubit unitary
• Fault-tolerant protection of near-term trapped-ion topological qubits under realistic noise sources
• Super-Golden-Gates for PU(2)
• Quantum computing by color-code lattice surgery
• Experimental protection of quantum gates against decoherence and control errors
• Characterization of an operational quantum resource in a critical many-body system
• Quantum Computing for Fusion Energy Science Applications
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• Learning quantum circuits of some $T$ gates
• Stabilizer extent is not multiplicative
• Reducing the Depth of Linear Reversible Quantum Circuits
• High-threshold topological quantum error correction against biased noise
• Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
• Distributed quantum error correction for chip-level catastrophic errors
• Quantum memories and error correction
• Distillation of quantum steering
• Towards a universal set of topologically protected gates for quantum computation with Pfaffian qubits
• Universal MBQC with generalised parity-phase interactions and Pauli measurements
• Topological Quantum Computing Using Nanowire Devices
• Depth optimization of CZ, CNOT, and Clifford circuits
• Gauge color codes in two dimensions
• Classical Processing Requirements for a Topological Quantum Computing System
• Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
• Quantum proofs can be verified using only single qubit measurements
• Error-detection-based quantum fault tolerance against discrete Pauli noise
• Handling Leakage with Subsystem Codes
• Probing non-Abelian statistics with Majorana fermion interferometry in spin-orbit-coupled semiconductors
• Morphing quantum codes
• Shorter quantum circuits via single-qubit gate approximation
• Tight constraints on probabilistic convertibility of quantum states
• A Non-Commuting Stabilizer Formalism
• Measurement-Based Quantum Computation
• Quantum Information meets High-Energy Physics: Input to the update of the European Strategy for Particle Physics
• Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen-Specker theorem: the Peres-Mermin square
• Recent progress on Majorana in semiconductor-superconductor heterostructures--Engineering and detection
• Optimal Universal Quantum Error Correction via Bounded Reference Frames
• Generalized Cluster States Based on Finite Groups
• A practical phase gate for producing Bell violations in Majorana wires
• Stabilizer entropy in non-integrable quantum evolutions
• Classical simulation of fermionic linear optics augmented with noisy ancillas
• Generation of Flying Logical Qubits using Generalized Photon Subtraction with Adaptive Gaussian Operations
• Continuous-variable entanglement distillation and non-commutative central limit theorems
• Contextuality of general probabilistic theories
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
• Exact gate decompositions for photonic quantum computing
• Efficient backcasting search for optical quantum state synthesis
• A polynomial time and space heuristic algorithm for T-count
• Lattice Surgery Translation for Quantum Computation
• Long-range Kitaev Chains via Planar Josephson Junctions
• Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate
• Simple scheme for encoding and decoding a qubit in unknown state for various topological codes
• Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
• Data centers with quantum random access memory and quantum networks
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
• A Family of Quantum Codes with Exotic Transversal Gates
• LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
• Virtual quantum resource distillation
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Robust Majorana magic gates via measurements
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• Nonstabilizerness of Permutationally Invariant Systems
• Arbitrary Dicke-State Control of Symmetric Rydberg Ensembles
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
• Composite Toffoli gate with two-round error detection
• Entanglement and Quantum Error Correction with Superconducting Qubits
• Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
• Tight Noise Thresholds for Quantum Computation with Perfect Stabilizer Operations
• Learning time-dependent noise to reduce logical errors: Real time error rate estimation in quantum error correction
• Accuracy threshold for concatenated error detection in one dimension
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Qutrit and Ququint Magic States
• Non-Clifford gate on optical qubits by nonlinear feedforward
• Maximum nonlocality and minimum uncertainty using magic states
• Hierarchical surface code for network quantum computing with modules of arbitrary size
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• Magic of quantum hypergraph states
• Exact and approximate continuous-variable gate decompositions
• Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
• Universal limitations on implementing resourceful unitary evolutions
• Long-distance quantum communication over noisy networks without long-time quantum memory
• Holomorphic representation of quantum computations
• Exact solution of long-range stabilizer Rényi entropy in the dual-unitary XXZ model
• A Spin-Optical Quantum Computing Architecture
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• The Impact of Imperfect Timekeeping on Quantum Control
• Achieving fault tolerance against amplitude-damping noise
• Quantifying non-stabilizerness via information scrambling
• Verifying the Smallest Interesting Colour Code with Quantomatic
• Quantifying dynamical magic with completely stabilizer preserving operations as free
• Constraints on magic state protocols from the statistical mechanics of Wigner negativity
• Towards Cosmological Simulations of Dark Matter on Quantum Computers
• Robust interface between flying and topological qubits
• Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
• Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
• Composing topological domain walls and anyon mobility
• Irrational Non-Abelian Statistics for Non-Hermitian Generalization of Majorana Zero Modes
• Realization of a deterministic quantum Toffoli gate with a single photon
• Photonic implementation of Majorana-based Berry phases
• Parafermions in a Kagome lattice of qubits for topological quantum computation
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• 6-qubit Optimal Clifford Circuits
• Topological One-Way Quantum Computation on Verified Logical Cluster States
• Realizing topologically ordered states on a quantum processor
• Logical Clifford Synthesis for Stabilizer Codes
• Improved Stabilizer Estimation via Bell Difference Sampling
• Measurement based quantum communication with resource states generated by entanglement purification
• Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits
• Transport signatures of Majorana bound states in superconducting hybrid structures
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
• Magic State Distillation from Entangled States
• Clifford Dressed Time-Dependent Variational Principle
• Resource theory of superposition: State transformations
• Classical simulation of non-Gaussian fermionic circuits
• Efficient mutual magic and magic capacity with matrix product states
• Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries
• Efficient Magic State Distillation by Zero-Level Distillation
• Adiabatic topological quantum computing
• A relational quantum computer using only two-qubit total spin measurement and an initial supply of highly mixed single qubit states
• Stabilizer Entropy and entanglement complexity in the Sachdev-Ye-Kitaev model
• Universal fault-tolerant quantum computation with Bacon-Shor codes
• One-Shot Yield-Cost Relations in General Quantum Resource Theories
• Stabilizer disentangling of conformal field theories
• Order 3 Symmetry in the Clifford Hierarchy
• Handbook for Quantifying Robustness of Magic
• Optimization of CNOT circuits on limited connectivity architecture
• Distillation of Indistinguishable Photons
• Contextuality and The Single-Qubit Stabilizer Formalism
• Simulating topological tensor networks with Majorana qubits
• Computational power of matchgates with supplementary resources
• Magic Resource Can Enhance the Quantum Capacity of Channels
• Fault-tolerant fermionic quantum computation based on color code
• One-dimensional quantum computing with a 'segmented chain' is feasible with today's gate fidelities
• Majorana quasiparticles in atomic spin chains on superconductors
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Cluster-based architecture for fault-tolerant quantum computation
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• End-to-end resource analysis for quantum interior point methods and portfolio optimization
• Gravitational back-reaction is magical
• Graph-theoretic strengths of contextuality
• Magic State Distillation with the Ternary Golay Code
• Streamlined quantum computing with macronode cluster states
• Approximate symmetries and quantum error correction
• Quantum Non-Local Nonstabilizerness
• A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
• Classification of Small Triorthogonal Codes
• State-injection schemes of quantum computation in Spekkens' toy theory
• Codesign of quantum error-correcting codes and modular chiplets in the presence of defects
• Stabilizer entropy of quantum tetrahedra
• Instantaneous braids and Dehn twists in topologically ordered states
• Non-stabilizerness in kinetically-constrained Rydberg atom arrays
• The role of cohomology in quantum computation with magic states
• A comparative study of universal quantum computing models: towards a physical unification
• Achieving fault tolerance on capped color codes with few ancillas
• Error rates and resource overheads of encoded three-qubit gates
• Fault-tolerant Holonomic Quantum Computation in Surface Codes
• Quasi-exact quantum computation
• Knots, links, and long-range magic
• Gottesman-Kitaev-Preskill state preparation using periodic driving
• Synthesizing Majorana zero-energy modes in a periodically gated quantum wire
• Stabilizer rank and higher-order Fourier analysis
• Resource theory of quantum coherence with probabilistically non-distinguishable pointers and corresponding wave-particle duality
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Un-Weyl-ing the Clifford Hierarchy
• Realization of a binary-outcome projection measurement of a three-level superconducting quantum system
• Arbitrary Amplification of Quantum Coherence in Asymptotic and Catalytic Transformation
• Magic informationally complete POVMs with permutations
• Fault-tolerant gates via homological product codes
• Fault-tolerant quantum metrology
• Process tomography of Robust Dynamical Decoupling in Superconducting Qubits
• Towers of generalized divisible quantum codes
• Nonlocality as a Benchmark for Universal Quantum Computation in Ising Anyon Topological Quantum Computers
• Entanglement and Stabilizer entropies of random bipartite pure quantum states
• Universal quantum computation in the surface code using non-Abelian islands
• Long-range-enhanced surface codes
• Measurement-only topological quantum computation without forced measurements
• Biased Gottesman-Kitaev-Preskill repetition code
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
• Randomized benchmarking of quantum gates implemented by electron spin resonance
• Spectral Properties Versus Magic Generation in $T$-doped Random Clifford Circuits
• A Regular Representation of Quantum Circuits
• The Classification of Clifford Gates over Qubits
• Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation
• Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing
• Noise threshold and resource cost of fault-tolerant quantum computing with Majorana fermions in hybrid systems
• A solution of the generalised quantum Stein's lemma
• Quantum error correction with fractal topological codes
• Optimizing Clifford gate generation for measurement-only topological quantum computation with Majorana zero modes
• Quantum circuit compilation and hybrid computation using Pauli-based computation
• Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits
• Quantum Complexity Fluctuations from Nuclear and Hypernuclear Forces
• Color code decoder with improved scaling for correcting circuit-level noise
• Engineering complex topological memories from simple Abelian models
• Fermion-Parity-Based Computation and its Majorana-Zero-Mode Implementation
• Magic of Random Matrix Product States
• Classical Coding Problem from Transversal $T$ Gates
• Engineering Yang-Lee anyons via Majorana bound states
• Dynamical structure factor in the non-Abelian phase of the Kitaev honeycomb model in the presence of quenched disorder
• Designing the Quantum Channels Induced by Diagonal Gates
• Interoperability in encoded quantum repeater networks
• Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
• Quantum Pin Codes
• Spekkens' toy model in all dimensions and its relationship with stabilizer quantum mechanics
• No-Go Theorems for Universal Entanglement Purification
• Entanglement complexity of the Rokhsar-Kivelson-sign wavefunctions
• Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding
• Pseudorandom density matrices
• The axiomatic and the operational approaches to resource theories of magic do not coincide
• The magic of universal quantum computing with permutations
• Set of Holonomic and Protected Gates on Topological Qubits for Realistic Quantum Computer
• Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits
• Topological qubits from valence bond solids
• Nonadaptive fault-tolerant verification of quantum supremacy with noise
• Non-Stabilizerness of Sachdev-Ye-Kitaev Model
• Majorana phase-gate based on the geometric phase
• Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap
• Fault-tolerant logical gates in holographic stabilizer codes are severely restricted
• A Blueprint for a Topologically Fault-tolerant Quantum Computer
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
• 3-Fermion topological quantum computation
• Topological contextuality and anyonic statistics of photonic-encoded parafermions
• Homotopical approach to quantum contextuality
• Synthesis of Arbitrary Quantum Circuits to Topological Assembly: Systematic, Online and Compact
• Fractional Chern insulator edges and layer-resolved lattice contacts
• Spin squeezed GKP codes for quantum error correction in atomic ensembles
• Universal quantum computing with parafermions assisted by a half fluxon
• Measurement-free fault-tolerant logical zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array
• Mitigating Coherent Noise by Balancing Weight-2 $Z$-Stabilizers
• The vacuum provides quantum advantage to otherwise simulatable architectures
• Magic phase transition and non-local complexity in generalized $W$ State
• Partitioning Quantum Chemistry Simulations with Clifford Circuits
• Experimental Demonstration of a Quantum Controlled-SWAP Gate with Multiple Degrees of Freedom of a Single Photon
• Tangling schedules eases hardware connectivity requirements for quantum error correction
• Nonstabilizerness dynamics in many-body localized systems
• Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
• Long-range nonstabilizerness and phases of matter
• High-dimensional quantum encoding via photon-subtracted squeezed states
• Topological thermoelectric effects in spin-orbit coupled electron and hole doped semiconductors
• Transversality versus Universality for Additive Quantum Codes
• Nonstabilizerness of a Boundary Time Crystal
• Stabilizer Rényi Entropy and Conformal Field Theory
• The Promise of Quantum Simulation
• Quantum phase transition in the $Z_3$ Kitaev-Potts model
• Magic transition in measurement-only circuits
• States that are far from being stabilizer states
• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
• Synthesis of Topological Quantum Circuits
• Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate
• CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate
• Reliable computation from contextual correlations
• On Groups in the Qubit Clifford Hierarchy
• Option pricing under stochastic volatility on a quantum computer
• Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences
• Compilation of a simple chemistry application to quantum error correction primitives
• Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
• Measurement-based infused circuits for variational quantum eigensolvers
• Entanglement manipulation and distillability beyond LOCC
• Extracting randomness from magic quantum states
• Improved Simulation of Quantum Circuits by Fewer Gaussian Eliminations
• The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
• On Topology of the Moduli Space of Gapped Hamiltonians for Topological Phases
• Quantum computational advantage with constant-temperature Gibbs sampling
• Interplay of entanglement structures and stabilizer entropy in spin models
• Distributed Quantum Computing with QMPI
• Universal resource-efficient topological measurement-based quantum computation via color-code-based cluster states
• Randomized Benchmarking of Clifford Operators
• Quantum Hypergraph States in Continuous Variables
• Mitigating errors in logical qubits
• Sufficient condition for universal quantum computation using bosonic circuits
• Generalised state spaces and non-locality in fault tolerant quantum computing schemes
• Quantum Expectation Transformers for Cost Analysis
• A nonstabilizerness monotone from stabilizerness asymmetry
• Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes
• Leveraging Qubit Loss Detection in Fault Tolerant Quantum Algorithms
• Fault-tolerant logical measurements via homological measurement
• Majorana zero modes on a 1D chain for quantum computation
• Magic State Distillation at Intermediate Size
• Contextual bound states for qudit magic state distillation
• Noise-resilient preparation of quantum many-body ground states
• Quantum Codes from Twisted Unitary $t$-groups
• Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
• The non-stabilizerness of fermionic Gaussian states
• The Poincaré half-plane for informationally complete POVMs
• Polarization and Orbital Angular Momentum Encoded Quantum Toffoli Gate Enabled by Diffractive Neural Networks
• Limitations of Classically-Simulable Measurements for Quantum State Discrimination
• Universal resources for quantum computing
• Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction
• Experimental test of high-dimensional quantum contextuality based on contextuality concentration
• Low-overhead quantum computing with the color code
• Symmetry Protected Quantum Computation
• Faster quantum computation with permutations and resonant couplings
• Universal Barenco quantum gates via a tunable non-collinear interaction
• Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
• High-fidelity gate operations for quantum computing beyond dephasing time limits
• Cost of postselection in decision theory
• Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
• Everything You Always Wanted to Know About Quantum Circuits
• An Entropic Lens on Stabilizer States
• Blind Quantum Computation Using a Circuit-Based Quantum Computer
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Fault-tolerant quantum speedup from constant depth quantum circuits
• Quantum Preparation Games
• Fermionic Magic Resources of Quantum Many-Body Systems
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing
• From the Bloch sphere to phase space representations with the Gottesman-Kitaev-Preskill encoding
• Group geometrical axioms for magic states of quantum computing
• Code switching revisited: Low-overhead magic state preparation using color codes
• Quantum Complexity: restrictions on algorithms and architectures
• Fault-tolerant linear optics quantum computation by error-detecting quantum state transfer
• Boosting photonic quantum computation with moderate nonlinearity
• Holonomic implementation of CNOT gate on topological Majorana qubits
• Lower Bounds on Stabilizer Rank
• Local Clustering Decoder as a fast and adaptive hardware decoder for the surface code
• Low-overhead magic state distillation with color codes
• A Specification Format and a Verification Method of Fault-Tolerant Quantum Circuits
• Accelerating Quantum Algorithms with Precomputation
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Measurement based Controlled Not gate for topological qubits in a Majorana fermion quantum-dot hybrid system
• Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
• Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits
• Quantum Ruzsa Divergence to Quantify Magic
• Quantum computation and measurements from an exotic space-time R4
• Flexible layout of surface code computations using AutoCCZ states
• Realization of a fast triple-magic all-optical qutrit in strontium-88
• Stabilizer Scars
• Topological $\pi$ modes and beyond
• Accuracy threshold for postselected quantum computation
• Quantum computing, Seifert surfaces and singular fibers
• Efficient witnessing and testing of magic in mixed quantum states
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Climbing the Diagonal Clifford Hierarchy
• Disentangling magic states with classically simulable quantum circuits
• Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
• Maximizing the purity of a qubit evolving in an anisotropic environment
• The quest and hope of Majorana zero modes in topological superconductor for fault-tolerant quantum computing: an introductory overview
• Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Clifford operations and homological codes for rotors and oscillators
• Computing quantum magic of state vectors
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Quantum computing for genomics: conceptual challenges and practical perspectives
• An Exact Link between Nonlocal Nonstabilizerness and Operator Entanglement
• New techniques for bounding stabilizer rank
• Magic state distillation with punctured polar codes
• Designs from magic-augmented Clifford circuits
• Small Codes for Magic State Distillation
• Feynman-path type simulation using stabilizer projector decomposition of unitaries
• Quantum computation by teleportation and symmetry
• Maximal Magic for Two-qubit States
• Hybrid magic state distillation for universal fault-tolerant quantum computation
• Is the SIC Outcome There When Nobody Looks?
• How SU(2)${}_4$ Anyons are Z${}_3$ Parafermions
• Stabilizer Rényi Entropy Encodes Fusion Rules of Topological Defects and Boundaries
• T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder
• Implementation of single-qubit gates via parametric modulation in the Majorana transmon
• Optimal and asymptotically optimal NCT reversible circuits by the gate types
• Design of a Majorana trijunction
• Code conversion with the quantum Golay code for a universal transversal gate set
• Verifying Fault-Tolerance of Quantum Error Correction Codes
• Operational interpretation of the Stabilizer Entropy
• Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
• Systematic construction of topological-nontopological hybrid universal quantum gates based on many-body Majorana fermion interactions
• Scaling W state circuits in the qudit Clifford hierarchy
• Software Pauli Tracking for Quantum Computation
• Automatic Test Pattern Generation for Robust Quantum Circuit Testing
• Black Box Work Extraction and Composite Hypothesis Testing
• Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States
• Quantum computing through electron propagation in the edge states of quantum spin Hall systems
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
• Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
• An introduction to reliable quantum computation
• Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
• Prepare-and-Magic: Semi-Device Independent Magic Certification in the Prepare-and-Measure Scenario
• The Hadamard gate cannot be replaced by a resource state in universal quantum computation
• Auxiliary-assisted energy distillation from quantum batteries
• A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation
• Geometric structure and transversal logic of quantum Reed-Muller codes
• A Universal Circuit Set Using the $S_3$ Quantum Double
• Classical product code constructions for quantum Calderbank-Shor-Steane codes
• Initial-state-dependent quantum speed limit for dissipative state preparation: Framework and optimization
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits
• The domain wall color code
• Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
• Stabilizer-Accelerated Quantum Many-Body Ground-State Estimation
• Braiding defects in topological stabiliser codes of any dimension cannot be universal
• Efficiently computing logical noise in quantum error correcting codes
• A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
• Locality-aware Pauli-based computation for local magic state preparation
• T-count Optimized Quantum Circuits for Bilinear Interpolation
• Hidden variable model for quantum computation with magic states on qudits of any dimension
• Computational self-testing for entangled magic states
• Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices
• Normalizer Circuits and Quantum Computation
• Error correcting power of small topological codes
• Wigner distribution on a double cylinder phase space for studying quantum error correction protocol
• Variations on the Choi-Jamiolkowski isomorphism
• Coherent control of the causal order of entanglement distillation
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• Optimization tools for distance-preserving flag fault-tolerant error correction
• Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
• Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based Quantum Computation
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
• Unconditional quantum magic advantage in shallow circuit computation
• Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware
• Local spreading of stabilizer Rényi entropy in a brickwork random Clifford circuit
• Fault-tolerant quantum computing with the parity code and noise-biased qubits
• Certifying nonstabilizerness in quantum processors
• Characterization of errors in a CNOT between surface code patches
• Faster computation of nonstabilizerness
• Unified Framework for Calculating Convex Roof Resource Measures
• Lower T-count with faster algorithms
• Transversal Clifford and T-gate codes of short length and high distance
• Role of quantum state texture in probing resource theories and quantum phase transition
• LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
• Measurement sequences for magic state distillation
• Fibre bundle framework for unitary quantum fault tolerance
• Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
• Postselection threshold against biased noise
• Choi-Defined Resource Theories
• Rise and fall of nonstabilizerness via random measurements
• Fast algorithms for classical specifications of stabiliser states and Clifford gates
• Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions
• Clifford Orbits from Cayley Graph Quotients
• Cosine series quantum sampling method with applications in signal and image processing
• Autonomous Stabilization of Floquet States Using Static Dissipation
• $T$-depth-optimized Quantum Search with Quantum Data-access Machine
• Classifying space for quantum contextuality
• Finding maximal quantum resources
• Blindly Factorizing 21 Quantumly
• Experimental implementation of Hardy-like quantum pigeonhole paradoxes
• Quantum Local Differential Privacy and Quantum Statistical Query Model
• Computational quantum-classical boundary of complex and noisy quantum systems
• Distance-four quantum codes with combined postselection and error correction
• The resource cost of large scale quantum computing
• Polynomial T-depth Quantum Solvability of Noisy Binary Linear Problem: From Quantum-Sample Preparation to Main Computation
• Magic State Injection with Erasure Qubits
• Momentum space magic for the transverse field quantum Ising model
• One-Shot Static Entanglement Cost of Bipartite Quantum Channels
• Lattice surgery-based logical state teleportation via noisy links
• End-to-end switchless architecture for fault-tolerant photonic quantum computing
• Abelian Hypergroups and Quantum Computation
• Signed quantum weight enumerators characterize qubit magic state distillation
• Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations
• Multipartite States under Elementary Local Operations
• Breaking global symmetries with locality-preserving operations
• Photon distillation schemes with reduced resource costs based on multiphoton Fourier interference
• An upper bound on quantum fault tolerant thresholds
• Representation matching for delegated quantum computing
• On The Round Complexity of Secure Quantum Computation
• Improved Strong Simulation of Universal Quantum Circuits
• Color codes with twists: construction and universal gate set implementation
• Planar Floquet Codes
• Error metric for non-trace-preserving quantum operations
• Weighted Quantum Channel Compiling through Proximal Policy Optimization
• Stellar representation of extremal Wigner-negative spin states
• Optimisation of time-ordered processes in the finite and asymptotic regime
• Non-stabilizerness and entanglement from cat-state injection
• Simulating quantum computation: how many "bits" for "it"?
• Counter-intuitive yet efficient regimes for measurement based quantum computation on symmetry protected spin chains
• Low-density parity-check representation of fault-tolerant quantum circuits
• Low Overhead Qutrit Magic State Distillation
• Invested and Potential Magic Resources in Measurement-Based Quantum Computation
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties
• Celestial Quantum Error Correction II: From Qudits to Celestial CFT
• Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks
• From Magic State Distillation to Dynamical Systems
• A 3D lattice defect and efficient computations in topological MBQC
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
• Contextuality of Quantum Error-Correcting Codes
• Clifford-Dressed Variational Principles for Precise Loschmidt Echoes
• Quantum resource estimates for computing binary elliptic curve discrete logarithms
• Nonadiabatic braiding of Majorana modes
• Scalable projected entangled-pair state representation of random quantum circuit states
• Typical Machine Learning Datasets as Low-Depth Quantum Circuits
• Measurement-free quantum error correction optimized for biased noise
• Topos logic in measurement-based quantum computation
• Analyzing the free states of one quantum resource theory as resource states of another
• Robustness of Magic in the quantum Ising chain via Quantum Monte Carlo tomography
• Robust Control and Entanglement of Qudits in Neutral Atom Arrays
• Majorana braiding simulations with projective measurements
• Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
• The Magic Barrier before Thermalization
• Quantum Simulation of Molecular Dynamics Processes -- A Benchmark Study Using Classical Simulator and Present-Day Quantum Hardware
• Quantum block lookahead adders and the wait for magic states
• Classical Coding Approaches to Quantum Applications
• Real-time decoding of stabilizer measurements in a bit-flip code
• Time versus Hardware: Reducing Qubit Counts with a (Surface Code) Data Bus
• Resource comparison of two surface code implementations of small angle Z rotations
• Applications of differential geometry and representation theory to description of quantum correlations
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• Preparing topologically ordered states by Hamiltonian interpolation
• Engineering Precise and Robust Effective Hamiltonians
• Practical recipes for the model order reduction, dynamical simulation, and compressive sampling of large-scale open quantum systems
• Chasing shadows with Gottesman-Kitaev-Preskill codes
• Targeted Clifford logical gates for hypergraph product codes
• Quantum subspace verification for error correction codes
• Quantum-to-Classical Transition via Single-Shot Generalized Measurements
• Type-Based Verification of Connectivity Constraints in Lattice Surgery
• On the Hardness of Measuring Magic
• Noise-Canceling Quantum Feedback: non-Hermitian Dynamics with Applications to State Preparation and Magic State Distillation
• Using a Kerr interaction for GKP magic state preparation
• Twisted Interferometry
• Entanglement and magic on the light-front
• Generating Compilers for Qubit Mapping and Routing
• State-adaptive quantum error correction and fault-tolerant quantum computing
• Pinned QMA: The power of fixing a few qubits in proofs
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
• Stabilizer Rényi Entropy for Translation-Invariant Matrix Product States
• Optimal number of stabilizer measurement rounds in an idling surface code patch
• Censorship of quantum resources against catalytic account sharing
• Optimal quantum reservoir learning in proximity to universality
• On the stabilizer complexity of Hawking radiation
• Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
• Efficient simulation of logical magic state preparation protocols
• All You Need is pi: Quantum Computing with Hermitian Gates
• Logical Noise Bias in Magic State Injection
• Spectral signatures of nonstabilizerness and criticality in infinite matrix product states
• Three-Qubit State Preparation: Classification and Explicit Circuits
• The robustness of magic state distillation against errors in Clifford gates
• Resource-efficient shadow tomography using equatorial stabilizer measurements
• Characterization of non-adaptive Clifford channels
• Bounding Entanglement Entropy with Clifford Double Cosets
• Simulation of quantum computation with magic states via Jordan-Wigner transformations
• Entanglement-assisted Quantum Reed-Muller Tensor Product Codes
• Halving the cost of quantum multiplexed rotations
• Clifford operators in SU(N)1; N not odd prime
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Quantum Theory from Principles, Quantum Software from Diagrams
• A graph-state based synthesis framework for Clifford isometries
• Quantum Computation and Communication in Bosonic Systems
• General entropic constraints on CSS codes within magic distillation protocols
• Symmetry-protected gates of Majorana qubits in a high-$T_c$ superconductor platform
• Twenty years of quantum contextuality at USTC
• A hierarchy in Majorana non-abelian tests and hidden variable models
• Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes
• Fractal Properties of Magic State Distillation
• Contextuality, Witness of Quantum Weirdness
• Lattice Surgery Compilation Beyond the Surface Code
• Quantum Merlin-Arthur with Clifford Arthur
• Quasi-${\Phi }_0$-periodic supercurrent at quantum Hall transitions
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States
• Twisted Interferometry: the topological perspective
• Quantum Magic in Discrete-Time Quantum Walk
• Finding the disjointness of stabilizer codes is NP-complete
• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code
• Clifford Transformations for Fermionic Quantum Systems: From Paulis to Majoranas to Fermions
• Universal quantum computation via scalable measurement-free error correction
• Optical Quantum Computing
• Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
• No-cost Bell nonlocality certification from quantum tomography and its applications in quantum-magic-resource witnessing
• Scalable and fault-tolerant preparation of encoded k-uniform states
• Quantum feedback for measurement and control
• Comparison of spin-qubit architectures for quantum error-correcting codes
• Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits
• Controlling distilleries in fault-tolerant quantum circuits: problem statement and analysis towards a solution
• Phase-sensitive superposition of quantum states
• Network Requirements for Distributed Quantum Computation
• Offloading Quantum Computation by Superposition Masking
• An Algorithm for Estimating $\alpha$-Stabilizer Rényi Entropies via Purity
• Flexible Fault Tolerant Gate Gadgets
• Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
• Measurement-Driven Adaptive Low-Overhead Implementation of Multi-Controlled Toffoli Gates
• Universal fault tolerant quantum computation in 2D without getting tied in knots
• Quantum Error Source and Channel Coding
• Quantum Chebyshev Probabilistic Models for Fragmentation Functions
• SWAP gate between a Majorana qubit and a parity-protected superconducting qubit
• Error-mitigated inference of quantum network topology
• Estimating Bell Diagonal states with separable measurements
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
• Quantum Computing with Variable Complex Plane. Light Beam Guide Implementation
• Classical representation of local Clifford operators
• Efficient classical simulation of cluster state quantum circuits with alternative inputs
• Mapping of Topological Quantum Circuits to Physical Hardware
• Constructing all qutrit controlled Clifford+T gates in Clifford+T
• Simulating Quantum Circuits by Shuffling Paulis
• Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
• A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra
• Contextuality from the vacuum
• Reducing depth and measurement weights in Pauli-based computation
• Quantum Resource Management in the NISQ Era: Challenges, Vision, and a Runtime Framework
• Synthesis of Quantum Circuits with an Island Genetic Algorithm
• Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms
• Enlarging the GKP stabilizer group for enhanced noise protection
• Quantum Optimal Control for Pure-State Preparation Using One Initial State
• Programming a Topological Quantum Computer
• Error detection without post-selection in adaptive quantum circuits
• Van Hove singularities in stabilizer entropy densities
• Qudit Noisy Stabilizer Formalism
• Fault Tolerant Quantum Simulation via Symplectic Transvections
• From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography
• Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
• Nonlinear photonic architecture for fault-tolerant quantum computing
• Optimized Clifford Noise Reduction: Theory, Simulations and Experiments
• Pseudoentanglement Ain't Cheap