Quantum algorithm for calculation of transition amplitudes in hybrid tensor networks
arXiv:2105.14182 · doi:10.1103/PhysRevA.104.042424
Abstract
The hybrid tensor network approach allows us to perform calculations on systems larger than the scale of a quantum computer. However, when calculating transition amplitudes, there is a problem that the number of terms to be measured increases exponentially with that of contracted operators. The problem is caused by the fact that the contracted operators are represented as non-Hermitian operators. In this study, we propose a method for the hybrid tensor network calculation that contracts non-Hermitian operators without the exponential increase of the number of terms. In the proposed method, calculations of transition amplitudes are performed by combining the singular value decomposition of the contracted non-Hermitian operators with the Hadamard test. The method significantly extends the applicability of the hybrid tensor network approach.
arXiv comment10 pages, 5 figures
References in corpus (30)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- The density-matrix renormalization group in the age of matrix product states
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum computational advantage using photons
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- Quantum Convolutional Neural Networks
- Error mitigation for short-depth quantum circuits
- Extending the computational reach of a noisy superconducting quantum processor
- Quantum algorithms for quantum chemistry and quantum materials science
- Quantum optimization using variational algorithms on near-term quantum devices
- Practical Quantum Error Mitigation for Near-Future Applications
- Hybrid quantum-classical algorithms and quantum error mitigation
- Quantum autoencoders for efficient compression of quantum data
- Variational Quantum Computation of Excited States
- Towards Quantum Machine Learning with Tensor Networks
- Variational quantum algorithms for discovering Hamiltonian spectra
- Variational Quantum State Diagonalization
- Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
- Variational Quantum Eigensolver with Fewer Qubits
- Downfolding of many-body Hamiltonians using active-space models: extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms
- Holographic quantum algorithms for simulating correlated spin systems
- Calculation of the Green's function on near-term quantum computers
- Quantum simulation with hybrid tensor networks
- Optimal resource cost for error mitigation
- Reducing qubit requirements while maintaining numerical precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach
- Post-Hartree-Fock method in Quantum Chemistry for Quantum Computer