Context aware quantum simulation of a matrix stored in quantum memory
arXiv:1904.01259 · doi:10.1007/s11128-019-2469-1
Abstract
In this paper a storage method and a context-aware circuit simulation idea are presented for the sum of block diagonal matrices. Using the design technique for a generalized circuit for the Hamiltonian dynamics through the truncated series, we generalize the idea to (0-1) matrices and discuss the generalization for the real matrices. The presented circuit requires number of quantum gates and yields the correct output with the success probability depending on the number of elements: for matrices with , the success probability is . Since the operations on the circuit are controlled by the data itself, the circuit can be considered as a context aware computing gadget. In addition, it can be used in variational quantum eigensolver and in the simulation of molecular Hamiltonians.
References in corpus (17)
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- The theory of variational hybrid quantum-classical algorithms
- Quantum fingerprinting
- Quantum random access memory
- Scalable Quantum Simulation of Molecular Energies
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating chemistry using quantum computers
- Architectures for a quantum random access memory
- Review of Decoherence Free Subspaces, Noiseless Subsystems, and Dynamical Decoupling
- Quantum Machine Learning for Electronic Structure Calculations
- On the robustness of bucket brigade quantum RAM
- Simulating sparse Hamiltonians with star decompositions
- Quantum computing methods for electronic states of the water molecule
- Universal Programmable Quantum Circuit Schemes to Emulate an Operator
- Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians
- A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series