Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Institute of Physics eBooks

Necessary and sufficient condition for quantum computing

Koji Nagata, Do Ngoc Diep, Ahmed Farouk, Tadao Nakamura

Published Jul 1, 2022• 0 citations
Publisher
DOI
10.1088/978-0-7503-4700-6ch17

Related papers

Necessary and Sufficient Conditions for Universal Gates with Pauli Strings and Beyond

Isaac D. Smith, Hans J. Briegel, Hendrik Poulsen Nautrup

Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. For the case where this set consists of only products of Pauli operators, known as Pauli strings, we provide a necessary and sufficient condition for it to generate $\mathfrak{su}(2^n)$, i.e., to be universal for quantum computation on $n$ qubits. When combining Pauli strings with a general Hamiltonian, we show a sufficient (and in certain circumstances even necessary) condition for universality based on the Pauli-basis expansion of the Hamiltonian. As an application of these results, we prove two corollaries: (i) a necessary and sufficient condition for the universality of a general Hamiltonian given arbitrary single-qubit control on all qubits, and (ii) the universality of an XYZ Heisenberg Hamiltonian with local control of just two adjacent qubits.

quant-pharXiv:2606.12096•Jun 11, 2026•0 citations

Necessary and Sufficient Condition for Quantum Computing

Koji Nagata, Tadao Nakamura, Ahmed Farouk +1 more

International Journal of Theoretical Physics•Oct 11, 2018•0 citations

Necessary and Sufficient Conditions for Quantum Computation

Seth Lloyd

Necessary and sufficient conditions are given for a quantummechanical system to possess a coordinate system with respect to which its behaviour at discrete times is that of a universal digital computer. The form of the diagonal representation for the unitary time evolution operator for quantum universal computers is derived; aspects of the transformation between the diagonal representation and the computational representation are shown to be uncomputable. A quantum-mechanical treatment of macroscopic, dissipative computers is given.

Journal of Modern Optics•Dec 1, 1994•19 citations

The Philosophy of Quantum Computing

Michael E. Cuffaro

arXiv:2103.09334•Springer eBooks•Jan 1, 2022•5 citations

Underlying theory for quantum computing

Charles R. Giardina

Elsevier eBooks•Jan 1, 2024•0 citations

Quantum Computing: General Considerations

David S. Simon

Undergraduate texts in physics•Jan 1, 2025•0 citations
Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. For the case where this set consists of only products of Pauli operators, known as Pauli strings, we provide a necessary and sufficient condition for it to generate su(2n)\mathfrak{su}(2^n)su(2n), i.e., to be universal for quantum computation on nnn qubits. When combining Pauli strings with a general Hamiltonian, we show a sufficient (and in certain circumstances even necessary) condition for universality based on the Pauli-basis expansion of the Hamiltonian. As an application of these results, we prove two corollaries: (i) a necessary and sufficient condition for the universality of a general Hamiltonian given arbitrary single-qubit control on all qubits, and (ii) the universality of an XYZ Heisenberg Hamiltonian with local control of just two adjacent qubits.
Necessary and sufficient conditions are given for a quantummechanical system to possess a coordinate system with respect to which its behaviour at discrete times is that of a universal digital computer. The form of the diagonal representation for the unitary time evolution operator for quantum universal computers is derived; aspects of the transformation between the diagonal representation and the computational representation are shown to be uncomputable. A quantum-mechanical treatment of macroscopic, dissipative computers is given.