Efficient quantum circuits for dense and non-unitary operators
arXiv:1607.07149
Abstract
Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering related fields. They are in general non-sparse and non-unitary. In this paper, we present efficient quantum circuits to implement circulant operators using fewer resources and with lower complexity than existing methods. Moreover, our quantum circuits can be readily extended to the implementation of Toeplitz, Hankel, and block circulant matrices. Efficient quantum algorithms to implement the inverses and products of circulant operators are also provided.
An example application in solving the equation of motion for a vibrating system with cyclic symmetry is added in Section 7
References in corpus (14)
- Quantum algorithms for supervised and unsupervised machine learning
- On the relationship between continuous- and discrete-time quantum walk
- Hamiltonian simulation with nearly optimal dependence on all parameters
- A new quantum ripple-carry addition circuit
- Architectures for a quantum random access memory
- Addition on a Quantum Computer
- Efficient Quantum Walk on a Quantum Processor
- Simulating sparse Hamiltonians with star decompositions
- Experimental quantum channel simulation
- Quantum circuit design for accurate simulation of qudit channels
- Block circulant matrices with circulant blocks, weil sums and mutually unbiased bases, II. The prime power case
- Limitations on the simulation of non-sparse Hamiltonians
- Discretely-observable continuous time quantum walks on Möbius strips and other exotic structures in 3D integrated photonics
- Integer Arithmetic With Hybrid Quantum-Classical Circuits