Quantum Computation
arXiv:2408.05448 · doi:10.1016/B978-0-323-95703-8.00259-7
Abstract
This chapter summarizes quantum computation, including the motivation for introducing quantum resources into computation and how quantum computation is done. Finally, this chapter articulates advantages and limitations of quantum computation, both fundamental and practical.
References in corpus (23)
- Quantum Computing in the NISQ era and beyond
- Quantum algorithm for solving linear systems of equations
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Amplitude Amplification and Estimation
- Quantum principal component analysis
- Quantum algorithms: an overview
- Efficient quantum algorithms for simulating sparse Hamiltonians
- The Physics of Maxwell's demon and information
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Universal computation by multi-particle quantum walk
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Bounds for the adiabatic approximation with applications to quantum computation
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- A quantum-inspired classical algorithm for recommendation systems
- A quantum linear system algorithm for dense matrices
- Inconsistency in the application of the adiabatic theorem
- Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- A note on the switching adiabatic theorem
- Quantum-Inspired Classical Algorithms for Singular Value Transformation
- Tight Bound for Estimating Expectation Values from a System of Linear Equations
- Channel Discord and Distortion