Quantum resources in Harrow-Hassidim-Lloyd algorithm
arXiv:2308.04021 · doi:10.1016/j.physleta.2024.129668
Abstract
Quantum algorithms have the ability to reduce runtime for executing tasks beyond the capabilities of classical algorithms. Therefore, identifying the resources responsible for quantum advantages is an interesting endeavour. We prove that nonvanishing quantum correlations, both bipartite and genuine multipartite entanglement, are required for solving nontrivial linear systems of equations in the Harrow-Hassidim-Lloyd (HHL) algorithm. Moreover, we find a nonvanishing l1-norm quantum coherence of the entire system and the register qubit which turns out to be related to the success probability of the algorithm. Quantitative analysis of the quantum resources reveals that while a significant amount of bipartite entanglement is generated in each step and required for this algorithm, multipartite entanglement content is inversely proportional to the performance indicator. In addition, we report that when imperfections chosen from Gaussian distribution are incorporated in controlled rotations, multipartite entanglement increases with the strength of the disorder, albeit error also increases while bipartite entanglement and coherence decreases, confirming the beneficial role of bipartite entanglement and coherence in this algorithm.
arXiv commentv1: 11 pages, 8 figures, v2: close to published version
References in corpus (48)
- Quantum entanglement
- Quantum Cryptography
- Separability Criterion for Density Matrices
- A computable measure of entanglement
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum sensing
- Separability of Mixed States: Necessary and Sufficient Conditions
- Quantum algorithm for solving linear systems of equations
- Quantifying Coherence
- Supervised learning with quantum enhanced feature spaces
- From Quantum Chaos and Eigenstate Thermalization to Statistical Mechanics and Thermodynamics
- Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
- Many-body localization, thermalization, and entanglement
- Quantum Coherence as a Resource
- The logarithmic negativity: A full entanglement monotone that is not convex
- Quantum Algorithms Revisited
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- A programmable two-qubit quantum processor in silicon
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- Experimental demonstration of Shor's algorithm with quantum entanglement
- Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- Monotones and invariants for multi-particle quantum states
- Quantum algorithm and circuit design solving the Poisson equation
- Experimental Quantum Computing to Solve Systems of Linear Equations
- Channel Capacities versus Entanglement Measures in Multiparty Quantum States
- Experimental realization of quantum algorithm for solving linear systems of equations
- Solving systems of linear equations on a quantum computer
- Solving Systems of Linear Equations with a Superconducting Quantum Processor
- Multipartite entanglement in quantum algorithms
- A Quantum Algorithm for Solving Linear Differential Equations: Theory and Experiment
- Simulating Quantum Dynamics On A Quantum Computer
- Fidelity approach to the disordered quantum XY model
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Quantum Circuit Design for Solving Linear Systems of Equations
- Experimental realization of a continuous version of the Grover algorithm
- Entanglement and coherence in Bernstein-Vazirani algorithm
- Scale invariance of entanglement dynamics in Grover's quantum search algorithm
- Disorder-Induced Order in Quantum XY Chains
- Scaling of the fidelity susceptibility in a disordered quantum spin chain
- Generalization and Demonstration of an Entanglement Based Deutsch-Jozsa Like Algorithm Using a 5-Qubit Quantum Computer
- Coherence Depletion in Quantum Algorithms
- Designing Robust Quantum Refrigerators in Disordered Spin Models
- Harrow-Hassidim-Lloyd algorithm without ancilla postselection
- Thermal Fluctuations Enhance Order-from-Disorder of Quantum Correlations in Quenched Disordered Spin Models
- An entangling-probe attack on Shor's algorithm for factorization
- A classical limit of Grover's algorithm induced by dephasing: Coherence vs entanglement