Quantum resources in Harrow-Hassidim-Lloyd algorithm
From MaRDI portal
Publication:6576533
DOI10.1016/J.PHYSLETA.2024.129668MaRDI QIDQ6576533FDOQ6576533
Leela Ganesh Chandra Lakkaraju, Tanoy Kanti Konar, Pradeep Kumar, Aditi Sen
Publication date: 22 July 2024
Published in: Physics Letters. A (Search for Journal in Brave)
Cites Work
- Quantum cryptography based on Bell’s theorem
- Quantum entanglement
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Separability of mixed states: necessary and sufficient conditions.
- Quantum Computation and Quantum Information
- Entanglement in many-body systems
- Entanglement and its role in Shor's algorithm
- Quantum algorithms revisited
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Separability Criterion for Density Matrices
- Quantum cryptography
- Rapid solution of problems by quantum computation
- Monotones and invariants for multi-particle quantum states
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Generalization and demonstration of an entanglement-based Deutsch-jozsa-like algorithm using a 5-qubit quantum computer
- Quantum algorithm and circuit design solving the Poisson equation
- Simulating quantum dynamics on a quantum computer
- Global multipartite entanglement dynamics in Grover's search algorithm
- A survey on HHL algorithm: from theory to application in quantum machine learning
- A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement
This page was built for publication: Quantum resources in Harrow-Hassidim-Lloyd algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576533)