Intermediate quantum maps for quantum computation
arXiv:quant-ph/0504230 · doi:10.1103/PhysRevA.72.042312
Abstract
We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity decay or spectral statistics. We study their matrix elements and entanglement production, and show that they converge with time to distributions which differ from random matrix predictions. A randomized version of these maps can be implemented even more economically, and yields pseudorandom operators with original properties, enabling for example to produce fractal random vectors. These algorithms are within reach of present-day quantum computers.
4 pages, 4 figures, research done at http://www.quantware.ups-tlse.fr/
References in corpus (23)
- On the Power of One Bit of Quantum Information
- Global entanglement in multiparticle systems
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- Testing statistical bounds on entanglement using quantum chaos
- Fidelity Decay as an Efficient Indicator of Quantum Chaos
- Composed ensembles of random unitary matrices
- Entangling power of the quantum baker's map
- Using a quantum computer to investigate quantum chaos
- Efficient Quantum Computing of Complex Dynamics
- Boundary conditions at the mobility edge
- A random matrix formulation of fidelity decay
- Experimental Implementation of the Quantum Baker's Map
- Exponential speed-up with a single bit of quantum information: Testing the quantum butterfly effect
- Exponential Gain in Quantum Computing of Quantum Chaos and Localization
- Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
- Entanglement Generation of Nearly-Random Operators
- Spectral statistics of a quantum interval-exchange map
- Intermediate statistics in quantum maps
- Dynamical localization simulated on a few qubits quantum computer
- Nearest-neighbor distribution for singular billiards
- Testing integrability with a single bit of quantum information
- Multifractal eigenstates of quantum chaos and the Thue-Morse sequence
- Quantum computation and analysis of Wigner and Husimi functions: toward a quantum image treatment
Cited by in corpus (7)
- Distribution of bipartite entanglement for random pure states
- Entanglement in random pure states: Spectral density and average von Neumann entropy
- Multifractal wave functions of simple quantum maps
- Multifractality and intermediate statistics in quantum maps
- Entanglement of localized states
- Quantum computation of multifractal exponents through the quantum wavelet transform
- Quantum computing of semiclassical formulas