Pith. sign in

REVIEW 2 cited by

Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.19114 v2 pith:3NWWISKQ submitted 2024-02-29 quant-ph

Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian

classification quant-ph
keywords quantumcomputationannealinggate-basedhamiltoniancomputersconventionalising
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures for quantum computation: gate-based quantum computers and quantum annealing. In gate-based quantum computation, we implement a sequence of quantum gates that manipulate qubits. This approach allows us to perform universal quantum computation, yet they pose significant experimental challenges for large-scale integration. On the other hand, with quantum annealing, the solution of the optimization problem can be obtained by preparing the ground state. Conventional quantum annealing devices with transverse-field Ising Hamiltonian, such as those manufactured by D-Wave Inc., achieving around 5000 qubits, are relatively more amenable to large-scale integration but are limited to specific computations. In this paper, we present a practical method for implementing universal quantum computation within the conventional quantum annealing architecture using the transverse-field Ising Hamiltonian. Our innovative approach relies on an adiabatic transformation of the Hamiltonian, changing from transverse fields to a ferromagnetic interaction regime, where the ground states become degenerate. Notably, our proposal is compatible with D-Wave devices, opening up possibilities for realizing large-scale gate-based quantum computers. This research bridges the gap between conventional quantum annealing and gate-based quantum computation, offering a promising path toward the development of scalable quantum computing platforms.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Analog-Digital Quantum Computing with Quantum Annealing Processors

    quant-ph 2026-03 unverdicted novelty 8.0

    Quantum annealing processors implement analog-digital quantum computing via effective XY-model evolution combined with auxiliary-qubit arbitrary-basis initialization and measurement, demonstrated through oscillations,...

  2. Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation

    quant-ph 2026-07 unverdicted novelty 7.0

    The global transverse-field Ising model with non-monotonic time-dependent transverse field is polynomially equivalent to the gate model of quantum computation.