Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
hub
Universal quantum computation with ideal Clifford gates and noisy ancillas.Physical Review A, 71(2)
15 Pith papers cite this work. Polarity classification is still indexing.
15
Pith papers citing it
hub tools
citation-role summary
background 2
other 1
citation-polarity summary
representative citing papers
Equivariant RL agent synthesizes near-optimal Clifford circuits up to 30 qubits with lower two-qubit gate counts than Qiskit baselines.
Hermitian weighted graphs enable universal exact realization of arbitrary complex QL-bits as real-spectrum eigenstates, with discrete {0, ±1, ±i} couplings dense in the state space.
Defines resource deficiency relative to maximal sets to extend operational interpretations of quantum resources and link them to experimental gate noise estimation.
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
Randomized sparse-QSVT reduces gate counts by up to 10x for inhomogeneous many-term Hamiltonians at moderate error (around 10^{-3}), but deterministic QSVT becomes cheaper for higher precision.
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
Postselection on typical syndromes in the toric code suppresses logical error rates from p_f to p_f^b with b approximately 3.1 via large-deviation arguments.
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above prior values.
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
Qubit allocation techniques for distributed color-code logical qubits achieve a 10% reduction in nonlocal gates that scales with more qubits, plus evaluations of methods for universal gate sets including a logical-swaps approach.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
citing papers explorer
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
-
Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis
Equivariant RL agent synthesizes near-optimal Clifford circuits up to 30 qubits with lower two-qubit gate counts than Qiskit baselines.
-
Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs
Hermitian weighted graphs enable universal exact realization of arbitrary complex QL-bits as real-spectrum eigenstates, with discrete {0, ±1, ±i} couplings dense in the state space.
-
A Deficiency-Based Approach for the Operational Interpretation of Quantum Resources with Applications
Defines resource deficiency relative to maximal sets to extend operational interpretations of quantum resources and link them to experimental gate noise estimation.
-
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
-
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
-
When is randomization advantageous in quantum simulation?
Randomized sparse-QSVT reduces gate counts by up to 10x for inhomogeneous many-term Hamiltonians at moderate error (around 10^{-3}), but deterministic QSVT becomes cheaper for higher precision.
-
Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
-
Scalable accuracy gains from postselection in quantum error correcting codes
Postselection on typical syndromes in the toric code suppresses logical error rates from p_f to p_f^b with b approximately 3.1 via large-deviation arguments.
-
Geometric and Resource-Theoretic Characterisation of Non-Stabiliserness in Quantum Algorithms
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
-
Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above prior values.
-
Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
-
Fire and ice: Partially fault-tolerant quantum computing with selective state filtering
Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.
-
Near-Term Reduction in Nonlocal Gate Count from Distributed Logical Qubits
Qubit allocation techniques for distributed color-code logical qubits achieve a 10% reduction in nonlocal gates that scales with more qubits, plus evaluations of methods for universal gate sets including a logical-swaps approach.
-
Maximum Likelihood Decoding of Quantum Error Correction Codes
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.