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
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
fields
quant-ph 5years
2026 5verdicts
UNVERDICTED 5representative citing papers
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).
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.
-
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).
-
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.