Polynomial T-depth Quantum Solvability of Noisy Binary Linear Problem: From Quantum-Sample Preparation to Main Computation

Abstract

The noisy binary linear problem (NBLP) is known as a computationally hard problem, and therefore, it offers primitives for post-quantum cryptography. An efficient quantum NBLP algorithm that exhibits a polynomial quantum sample and time complexities has recently been proposed. However, the algorithm requires a large number of samples to be loaded in a highly entangled state and it is unclear whether such a precondition on the quantum speedup can be obtained efficiently. Here, we present a complete analysis of the quantum solvability of the NBLP by considering the entire algorithm process, namely from the preparation of the quantum sample to the main computation. By assuming that the algorithm runs on "fault-tolerant" quantum circuitry, we introduce a reasonable measure of the computational time cost. The measure is defined in terms of the overall number of T gate layers, referred to as T-depth complexity. We show that the cost of solving the NBLP can be polynomial in the problem size, at the expense of an exponentially increasing logical qubits.

arXiv comment15 pages, 4 figures; Comment welcome

References in corpus (23)

• Quantum algorithm for solving linear systems of equations
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum random access memory
• Topological fault-tolerance in cluster state quantum computation
• Surface code quantum computing by lattice surgery
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Quantum advantage in learning from experiments
• Quantum machine learning: a classical perspective
• High threshold universal quantum computation on the surface code
• Restrictions on Transversal Encoded Quantum Gate Sets
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Methodology for quantum logic gate constructions
• Quantum circuits of T-depth one
• Approximate Quantum Fourier Transform and Decoherence
• Circuit-Based Quantum Random Access Memory for Classical Data
• Approximate Quantum Fourier Transform with $O(n\log (n))$ T gates
• Fault tolerant resource estimation of quantum random-access memories
• Quantum learning robust to noise
• Clifford Gates by Code Deformation
• Learning with Errors is easy with quantum samples
• Quantum unary approach to option pricing
• Parallelising the Queries in Bucket Brigade Quantum RAM
• Quantum solvability of noisy linear problems by divide-and-conquer strategy

Cited by in corpus (2)

• $T$-depth-optimized Quantum Search with Quantum Data-access Machine
• Sample-size-reduction of quantum states for the noisy linear problem