Efficient implementation of unitary transformations
arXiv:1901.03431
Abstract
Quantum computation and quantum control operate by building unitary transformations out of sequences of elementary quantum logic operations or applications of control fields. This paper puts upper bounds on the minimum time required to implement a desired unitary transformation on a d-dimensional Hilbert space when applying sequences of Hamiltonian transformations. We show that strategies of building up a desired unitary out of non-infinitesimal and infinitesimal unitaries, or equivalently, using power and band limited controls, can yield the best possible scaling in time .
14 pages plus appendices, 4 figures
References in corpus (23)
- Quantum Computing in the NISQ era and beyond
- Quantum Simulation
- Quantum support vector machine for big data classification
- Quantum principal component analysis
- Quantum computation over continuous variables
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Synthesis of Quantum Logic Circuits
- Building logical qubits in a superconducting quantum computing system
- On the relationship between continuous- and discrete-time quantum walk
- Quantum Circuits for General Multiqubit Gates
- Fast quantum logic gates with trapped-ion qubits
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- Nearly optimal lattice simulation by product formulas
- Measurement of many-body chaos using a quantum clock
- Realisation of a programmable two-qubit quantum processor
- Quantum control by von Neumann measurements
- An information theoretical analysis of quantum optimal control
- Simulating sparse Hamiltonians with star decompositions
- How to decompose arbitrary continuous-variable quantum operations
- Product Formulas for Exponentials of Commutators
- Universal Quantum Emulator
- Universal Refocusing of Systematic Quantum Noise