A hierarchical hybrid QAOA algorithm for graph k-coloring partitions the graph, colors subgraphs quantumly and the interaction graph classically, and merges via feedback, but its iterative version succeeds in only 43.77% of test cases.
Noise-Resistant Quantum State Compression Readout
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Qubit measurement is generally the most error-prone operation that degrades the performance of near-term quantum devices, and the exponential decay of readout fidelity severely impedes the development of large-scale quantum information processing. Given these disadvantages, we present a quantum state readout method, named \textit{compression readout}, that naturally avoids large multi-qubit measurement errors by compressing the quantum state into a single qubit for measurement. Our method generally outperforms direct measurements in terms of accuracy, and the advantage grows with the system size. Moreover, because only one-qubit measurements are performed, our method requires solely a fine readout calibration on one qubit and is free of correlated measurement error, which drastically diminishes the demand for device calibration. These advantages suggest that our method can immediately boost the readout performance of near-term quantum devices and will greatly benefit the development of large-scale quantum computing.
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Efficient hybrid variational quantum algorithm for solving graph coloring problem
A hierarchical hybrid QAOA algorithm for graph k-coloring partitions the graph, colors subgraphs quantumly and the interaction graph classically, and merges via feedback, but its iterative version succeeds in only 43.77% of test cases.