Higher-order quantum processes respecting closed labs in classical spacetime are exactly those realizable as quantum circuits with quantum control of causal order.
Combining hard and soft decoders for hypergraph product codes
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 8roles
background 1polarities
background 1representative citing papers
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.
A projection-based model reduction enables exponential state-space reduction for constrained quantum optimization applied to random 3-SAT and agent coordination on graphs.
KOVAL-Q uses SAT solving to optimize and verify surface-code logical operations with general encodings, finding d-cycle CNOTs and 2d-cycle rotations that reduce FTQC application runtime by about 10 percent.
Iterative-QAOA solves pangenome assembly instances on current quantum hardware by using a fixed-ramp QAOA schedule with warm-start updates and a new HUBO encoding that cuts variables from O(N^{2}) to O(N log N).
A new framework for spatial quantum sensing constructs non-local estimators for field properties using quantum sensor networks, with algebraic geometry for exact placements, entanglement for maximal precision, and error-free subspaces to cut sensor requirements.
DART-Q shows that cached state organization, overload policies, and service capacity determine whether real-time QLDPC decoders can meet deadlines under finite memory and varying load.
citing papers explorer
-
Higher-order quantum processes respecting closed labs in a spacetime have quantum controlled causal order
Higher-order quantum processes respecting closed labs in classical spacetime are exactly those realizable as quantum circuits with quantum control of causal order.
-
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
Graphical Algebraic Geometry creates universal diagrammatic languages for commutative algebras and affine varieties that also characterize the qudit ZH calculus for quantum computation.
-
Linear-Time T-Gate Optimization via Random Abstraction
A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.
-
Constrained Quantum Optimization meets Model Reduction
A projection-based model reduction enables exponential state-space reduction for constrained quantum optimization applied to random 3-SAT and agent coordination on graphs.
-
Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings
KOVAL-Q uses SAT solving to optimize and verify surface-code logical operations with general encodings, finding d-cycle CNOTs and 2d-cycle rotations that reduce FTQC application runtime by about 10 percent.
-
Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly
Iterative-QAOA solves pangenome assembly instances on current quantum hardware by using a fixed-ramp QAOA schedule with warm-start updates and a new HUBO encoding that cuts variables from O(N^{2}) to O(N log N).
-
A Framework for Spatial Quantum Sensing
A new framework for spatial quantum sensing constructs non-local estimators for field properties using quantum sensor networks, with algebraic geometry for exact placements, entanglement for maximal precision, and error-free subspaces to cut sensor requirements.
-
DART-Q : A Deadline-Driven Framework for Real-Time QLDPC Decoding
DART-Q shows that cached state organization, overload policies, and service capacity determine whether real-time QLDPC decoders can meet deadlines under finite memory and varying load.