CRiSP uses neural-guided MCTS and curriculum learning to insert Clifford prefixes before parameterized rotations in VQAs, yielding mean 3.17x and max 45x gains in energy accuracy on 22-qubit QAOA benchmarks versus prior Clifford initializers.
A fast quantum mechanical algorithm for database search
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 6verdicts
UNVERDICTED 6roles
background 1polarities
background 1representative citing papers
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.
A zero-level CCZ distillation protocol using the [[8,3,2]] code and lattice surgery achieves logical error rate scaling p_L ≈ 300 p² with only 22 physical qubits and 24 circuit depth.
A universal superstabilizer method adapts color codes on square lattices to isolated defects in data and ancilla qubits, with optimizations that reuse resources and support Clifford gates plus lattice surgery.
Quantum state transfer via discrete-time quantum walks occurs on butterfly graphs and is robust to unital and non-unital noises.
Optimization-free Recursive QAOA solves the Binary Paint Shop Problem near-optimally with reduced quantum resources and robustness to parameter choice compared to standard QAOA.
citing papers explorer
-
Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning
CRiSP uses neural-guided MCTS and curriculum learning to insert Clifford prefixes before parameterized rotations in VQAs, yielding mean 3.17x and max 45x gains in energy accuracy on 22-qubit QAOA benchmarks versus prior Clifford initializers.
-
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.
-
Zero-level $CCZ$ Distillation
A zero-level CCZ distillation protocol using the [[8,3,2]] code and lattice surgery achieves logical error rate scaling p_L ≈ 300 p² with only 22 physical qubits and 24 circuit depth.
-
Adaptive Deformation of Color Code in Square Lattices with Defects
A universal superstabilizer method adapts color codes on square lattices to isolated defects in data and ancilla qubits, with optimizations that reuse resources and support Clifford gates plus lattice surgery.
-
Quantum state transfer on a scalable network under unital and non-unital noise
Quantum state transfer via discrete-time quantum walks occurs on butterfly graphs and is robust to unital and non-unital noises.
-
Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem
Optimization-free Recursive QAOA solves the Binary Paint Shop Problem near-optimally with reduced quantum resources and robustness to parameter choice compared to standard QAOA.