A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
Title resolution pending
9 Pith papers cite this work, alongside 299 external citations. Polarity classification is still indexing.
9
Pith papers citing it
299
external citations · OpenAlex
citation-role summary
background 1
other 1
citation-polarity summary
fields
quant-ph 9verdicts
UNVERDICTED 9representative citing papers
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 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.
Non-adaptive non-signaling assistance simulates quantum communication in PM scenarios with a classical dit replacing a qudit, while adaptive NS advantages are confined to single-setting receiver cases.
A weak-coupling approximation reduces classical overhead in quantum circuit knitting to polynomial cost when one qubit couples weakly to others, shown on QAOA-style layered circuits.
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical noise with under 30 data qubits per logical qubit.
Full extractors for HGP codes are built to enable logical processing via PBC without compilation overhead, with sizes 50-80% of base codes and low error rates in simulations.
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.
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
citing papers explorer
-
In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes
A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
-
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.
-
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.
-
Non-signaling assistance in prepare-and-measure scenarios with classical communication
Non-adaptive non-signaling assistance simulates quantum communication in PM scenarios with a classical dit replacing a qudit, while adaptive NS advantages are confined to single-setting receiver cases.
-
Scalable quantum circuit knitting using a weak-coupling approximation
A weak-coupling approximation reduces classical overhead in quantum circuit knitting to polynomial cost when one qubit couples weakly to others, shown on QAOA-style layered circuits.
-
Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical noise with under 30 data qubits per logical qubit.
-
Full Extractors for Logical Processing in Hypergraph Product Codes
Full extractors for HGP codes are built to enable logical processing via PBC without compilation overhead, with sizes 50-80% of base codes and low error rates in simulations.
-
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.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.