Comment on ``Testing integrability with a single bit of quantum information''
Howard M. Wiseman
Abstract
In quant-ph/0303042, Poulin, Laflamme, Milburn and Paz consider the problem of distinguishing quantum chaos from quantum integrability for dynamics in an N-dimensional Hilbert space. They claim that this can be done by deterministic quantum computing with a single bit using O(N) physical resources, compared to O(N) physical resources classically. I point out what seems to be a fatal flaw with their proposal.
Create a lesson
Related papers
An entangling Hubbard quasiparticle collider on a digital quantum processor
Chan Bin Bark, Hanbyul Kim, Yoonil Koo et al.
A Warped Born Rule Turns an Observer into a Maxwell's Demon
Olumakinde Ogunnaike
A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians
Yutaro Iiyama
Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro et al.
Maximally antiflat fixed-particle-number fermionic states
Rahul Gupta, Arya Haghighian, James D. Whitfield
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
Otto Menegasso Pires, André Saimon, Daniela Herrmann et al.