Toric code decodability under coherent X/Z errors is dual to Majorana monitored dynamics whose symmetry class (D or DIII) dictates whether the generic transition is a measurement-induced entanglement transition or a topological transition between area-law phases.
hub Canonical reference
Evered, Alexandra A
Canonical reference. 86% of citing Pith papers cite this work as background.
26
Pith papers citing it
974
external citations · Crossref
Background
86% of classified citations
hub tools
citation-role summary
background 7
citation-polarity summary
roles
background 7representative citing papers
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
Co-optimization of flexible Iceberg error-detection gadgets with QAOA via tree search improves success probability and post-selection on Quantinuum H2-1 hardware up to 34 algorithmic qubits.
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.
A divide-and-conquer algorithm decomposes atom reconfiguration into three 1D shuttling tasks, enabling O(sqrt N) total transportation cost and reliable solutions via the Gale-Ryser theorem for arbitrary geometries.
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.
Bayesian PSR with Gaussian processes and GradCoRe accelerates VQE SGD by reusing observations and minimizing per-step costs while reducing to standard PSR in special cases.
Proposes multi-component bridge states outside cat code space for syndrome extraction in teleportation-based cat code QEC when nonlinear interactions are limiting.
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.
Numerical simulations indicate isotropic errors degrade Grover's algorithm performance and success probability on noisy quantum hardware.
Continuous-variable photonic platform with 20,000-mode cluster state simulates advection transport equation, achieving relative errors of 0.8% and 0.92% on first- and second-order moments via homodyne readout.
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
Introduces a framework for universal fully holonomic adiabatic gates in Rydberg atom systems with geometric robustness analysis.
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.
Most institutions should start with the smallest quantum capability layer that delivers repeatable near-term value and builds expertise rather than acquiring large on-premises systems.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
Review of optical metasurfaces enabling large-scale neutral-atom trapping arrays for quantum information technologies.
Enrico Fermi's legacy from his Varenna lectures has shaped milestones in laser spectroscopy, Bose-Einstein condensation, and quantum information science.
citing papers explorer
-
Decoding coherent errors in toric codes on honeycomb and square lattices: duality to Majorana monitored dynamics and symmetry classes
Toric code decodability under coherent X/Z errors is dual to Majorana monitored dynamics whose symmetry class (D or DIII) dictates whether the generic transition is a measurement-induced entanglement transition or a topological transition between area-law phases.
-
Forward-Assisted Purification: A Spatiotemporal Framework Beyond Conventional Limits
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
-
Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm
Co-optimization of flexible Iceberg error-detection gadgets with QAOA via tree search improves success probability and post-selection on Quantinuum H2-1 hardware up to 34 algorithmic qubits.
-
Parallel Logical Measurements via Quantum Code Surgery
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
-
Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
-
Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study
A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.
-
Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers
A divide-and-conquer algorithm decomposes atom reconfiguration into three 1D shuttling tasks, enabling O(sqrt N) total transportation cost and reliable solutions via the Gale-Ryser theorem for arbitrary geometries.
-
Architecting Distributed Quantum Computers: Design Insights from Resource Estimation
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.
-
Bayesian Parameter Shift Rule in Variational Quantum Eigensolvers
Bayesian PSR with Gaussian processes and GradCoRe accelerates VQE SGD by reusing observations and minimizing per-step costs while reducing to standard PSR in special cases.
-
Use of Faulty States in Cat-Code Error Correction
Proposes multi-component bridge states outside cat code space for syndrome extraction in teleportation-based cat code QEC when nonlinear interactions are limiting.
-
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.
-
Effect of isotropic errors on the complexity of Grover's algorithm
Numerical simulations indicate isotropic errors degrade Grover's algorithm performance and success probability on noisy quantum hardware.
-
Analog photonic simulator for large-scale transport
Continuous-variable photonic platform with 20,000-mode cluster state simulates advection transport equation, achieving relative errors of 0.8% and 0.92% on first- and second-order moments via homodyne readout.
-
Resource Management in Heterogeneous Quantum Repeater Networks
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
-
Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
-
Holonomic quantum computation: a scalable adiabatic architecture
Introduces a framework for universal fully holonomic adiabatic gates in Rydberg atom systems with geometric robustness analysis.
-
Managing Classical Processing Requirements for Quantum Error Correction
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
-
Probing the Planck scale with quantum computation
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.
-
What quantum computer to buy?
Most institutions should start with the smallest quantum capability layer that delivers repeatable near-term value and builds expertise rather than acquiring large on-premises systems.
-
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.
-
Metasurfaces for neutral-atom trapping
Review of optical metasurfaces enabling large-scale neutral-atom trapping arrays for quantum information technologies.
-
The Legacy of Enrico Fermi to Varenna
Enrico Fermi's legacy from his Varenna lectures has shaped milestones in laser spectroscopy, Bose-Einstein condensation, and quantum information science.
-
The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.
- GreenPeas: Unlocking adaptive quantum error correction with just-in-time decoding hypergraphs