We study the effect of quantum non-integrability in quantum computation. A quantum Hamiltonian H = 1 2 (p 2 x + p 2 y + x 2 y 2 ) whose classical counterpart is known to be non-integrable is considered as a candidate of quantum non-integrable Hamiltonian using the Weyl rule. Our analysis illustrates a relation between quantum computability and quantum integrability, whose classical limit corresponds to the known fact that there is no symplectic integrators which preserves the total energy for autonomous non-integrable Hamiltonian systems
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is...
We analyze the stability of quantum computations on physically realizable quantum computers by simul...
The standard generic quantum computer model is studied analytically and numerically and the border f...
We explicitly show how to simulate time-dependent sparse Hamiltonian evolution on a quantum computer...
We explore in the framework of quantum computation the notion of computability, which holds a centra...
The subject of the four manuscripts which make up this dissertation is the concept of integrability ...
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with dif...
It is well known that a quantum circuit on N qubits composed of Clifford gates with the addition of ...
This paper studies the computational power of quantum computers to explore as to whether they can re...
This paper studies the computational power of quantum computers to explore as to whether they can re...
A new formulation of the quantum integrability condition for spin systems is proposed. It eliminates...
Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task...
We show that deterministic quantum computing with a single bit (DQC1) can determine whether the clas...
Noncanonical quantization schemes have been proposed in quantum physics long time ago. Recalling som...
Quantum computation is a theoretical computation model that processes information in a quantum mecha...
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is...
We analyze the stability of quantum computations on physically realizable quantum computers by simul...
The standard generic quantum computer model is studied analytically and numerically and the border f...
We explicitly show how to simulate time-dependent sparse Hamiltonian evolution on a quantum computer...
We explore in the framework of quantum computation the notion of computability, which holds a centra...
The subject of the four manuscripts which make up this dissertation is the concept of integrability ...
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with dif...
It is well known that a quantum circuit on N qubits composed of Clifford gates with the addition of ...
This paper studies the computational power of quantum computers to explore as to whether they can re...
This paper studies the computational power of quantum computers to explore as to whether they can re...
A new formulation of the quantum integrability condition for spin systems is proposed. It eliminates...
Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task...
We show that deterministic quantum computing with a single bit (DQC1) can determine whether the clas...
Noncanonical quantization schemes have been proposed in quantum physics long time ago. Recalling som...
Quantum computation is a theoretical computation model that processes information in a quantum mecha...
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is...
We analyze the stability of quantum computations on physically realizable quantum computers by simul...
The standard generic quantum computer model is studied analytically and numerically and the border f...