Multivariate DQI uses N-variable polynomials for weighted Max-LINSAT, derives closed-form asymptotics for expectation and concentration, provides a single-decoder preparation circuit, and shows outperformance over weighted Prange for some OPI cases while extending to Hamiltonian DQI.
No quantum advantage in decoded quantum interferometry for maxcut
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
fields
quant-ph 8years
2026 8verdicts
UNVERDICTED 8roles
background 3polarities
background 3representative citing papers
Locally-quantum decoding of LDPC codes under coherent bit-flip superpositions outperforms BP and sometimes Prange/SA on Gallager max-k-XORSAT, but an enhanced Prange algorithm ties it.
Extends NP-hardness of exceeding r/q + O(1/sqrt(D)) for bounded-degree max-Ek-LINSAT(q,r) over F_q and shows quantum decoding is required for DQI to achieve the hardness-optimal 1/sqrt(D) scaling.
Decoded quantum interferometry is generalized to translation association schemes, reducing analysis to tridiagonal eigenvalue problems, with a finite-field matrix rank-difference protocol that produces constant-probability residual-rank bounds but no additive optimality guarantee.
DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.
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.
A Master Theorem gives a strictly tighter lower bound on quantum advantage in DQI by replacing the worst-case error penalty with an eigenvector-weighted Rayleigh quotient penalty.
A review describing the Decoded Quantum Interferometry algorithm for quantum speedups in max-LINSAT optimization, with claimed superpolynomial advantage in the OPI problem.
citing papers explorer
-
Multivariate Decoded Quantum Interferometry for Weighted Optimization
Multivariate DQI uses N-variable polynomials for weighted Max-LINSAT, derives closed-form asymptotics for expectation and concentration, provides a single-decoder preparation circuit, and shows outperformance over weighted Prange for some OPI cases while extending to Hamiltonian DQI.
-
Optimization Using Locally-Quantum Decoders
Locally-quantum decoding of LDPC codes under coherent bit-flip superpositions outperforms BP and sometimes Prange/SA on Gallager max-k-XORSAT, but an enhanced Prange algorithm ties it.
-
Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry
Extends NP-hardness of exceeding r/q + O(1/sqrt(D)) for bounded-degree max-Ek-LINSAT(q,r) over F_q and shows quantum decoding is required for DQI to achieve the hardness-optimal 1/sqrt(D) scaling.
-
Decoded Quantum Interferometry Beyond Hamming: Rank-Metric and Translation Association Schemes
Decoded quantum interferometry is generalized to translation association schemes, reducing analysis to tridiagonal eigenvalue problems, with a finite-field matrix rank-difference protocol that produces constant-probability residual-rank bounds but no additive optimality guarantee.
-
From Constraint to Code: DQI-Kit -- A Software Framework for Decoded Quantum Interferometry
DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.
-
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.
-
Hidden Quantum Advantage near the Decoding Threshold of Decoded Quantum Interferometry
A Master Theorem gives a strictly tighter lower bound on quantum advantage in DQI by replacing the worst-case error penalty with an eigenvector-weighted Rayleigh quotient penalty.
-
Quantum Decoding Algorithms: Quantum Speedups in Optimization
A review describing the Decoded Quantum Interferometry algorithm for quantum speedups in max-LINSAT optimization, with claimed superpolynomial advantage in the OPI problem.