It is well known that a quantum circuit on N qubits composed of Clifford gates with the addition of k non Clifford gates can be simulated on a classical computer by an algorithm scaling as poly(N)exp (k)[1]. We show that, for a quantum circuit to simulate quantum chaotic behavior, it is both necessary and sufficient that k = Θ(N). This result implies the impossibility of simulating quantum chaos on a classical computer
The complexity of quantum states has become a key quantity of interest across various subfields of p...
Universal quantum computation can be achieved with a gate set that includes a generating set of Clif...
We show that deterministic quantum computing with a single bit can determine whether the classical l...
It is well known that a quantum circuit on N qubits composed of Clifford gates with the addition of ...
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physic...
Clifford gates are a winsome class of quantum operations combining mathematical el-egance with physi...
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physic...
We show on the example of the Arnold cat map that classical chaotic systems can be simulated with ex...
We study the classical simulatability of commuting quantum circuits with n input qubits and O(log n)...
Random Clifford circuits doped with non Clifford gates exhibit transitions to universal entanglement...
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a ...
It was recently shown (quant-ph/9909074) that parasitic random interactions between the qubits in a ...
A model of quantum computation based on unitary ma-trix operations was introduced by Feynman and Deu...
The complexity of quantum states has become a key quantity of interest across various subfields of p...
Universal quantum computation can be achieved with a gate set that includes a generating set of Clif...
We show that deterministic quantum computing with a single bit can determine whether the classical l...
It is well known that a quantum circuit on N qubits composed of Clifford gates with the addition of ...
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physic...
Clifford gates are a winsome class of quantum operations combining mathematical el-egance with physi...
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physic...
We show on the example of the Arnold cat map that classical chaotic systems can be simulated with ex...
We study the classical simulatability of commuting quantum circuits with n input qubits and O(log n)...
Random Clifford circuits doped with non Clifford gates exhibit transitions to universal entanglement...
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a ...
It was recently shown (quant-ph/9909074) that parasitic random interactions between the qubits in a ...
A model of quantum computation based on unitary ma-trix operations was introduced by Feynman and Deu...
The complexity of quantum states has become a key quantity of interest across various subfields of p...
Universal quantum computation can be achieved with a gate set that includes a generating set of Clif...
We show that deterministic quantum computing with a single bit can determine whether the classical l...