Benchmarking Techniques for Decoded Quantum Interferometry
Leon Bollmann, Maximilian Hess
TL;DR
This paper introduces a benchmarking scheme for Decoded Quantum Interferometry (DQI), quantifies quantum gate requirements, and compares DQI's performance against classical solvers using the Binary Paint Shop Problem.
Contribution
It presents a novel benchmarking method for DQI and provides an explicit quantum circuit implementation for decoding in max-2-XORSAT problems.
Findings
Benchmarking scheme quantifies quantum gate requirements for DQI.
DQI performance is compared with classical solvers on BPSP.
Explicit quantum circuit for low-density parity check code decoding is provided.
Abstract
We develop a new benchmarking scheme for the Decoded Quantum Interferometry (DQI) algorithm quantifying the number of quantum gates required to obtain an optimal solution to a problem amenable to DQI. We apply the benchmarking scheme to the Binary Paint Shop Problem (BPSP) in order to benchmark the performance of DQI against a state of the art classical solver. To do so, we provide an explicit construction of a quantum circuit implementation of a greedy decoder for low-density parity check codes arising from max-2-XORSAT problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Complexity and Algorithms in Graphs