Experimental Demonstrations of Native Implementation of Boolean Logic Hamiltonian in a Superconducting Quantum Annealer
release_zork6ha6pzffhldx7gqsm3gkga
by
Daisuke Saida, Yuki Yamanashi, Mutsuo Hidaka, Fuminori Hirayama, Kentaro Imafuku, Shuichi Nagasawa, Shiro Kawabata
2021
Abstract
Experimental demonstrations of quantum annealing with native implementation
of Boolean logic Hamiltonians are reported. As a superconducting integrated
circuit, a problem Hamiltonian whose set of ground states is consistent with a
given truth table is implemented for quantum annealing with no redundant
qubits. As examples of the truth table, NAND and NOR are successfully
fabricated as an identical circuit. Similarly, a native implementation of a
multiplier comprising six superconducting flux qubits is also demonstrated.
These native implementations of Hamiltonians consistent with Boolean logic
provide an efficient and scalable way of applying annealing computation to
so-called circuit satisfiability problems that aim to find a set of inputs
consistent with a given output over any Boolean logic functions, especially
those like factorization through a multiplier Hamiltonian. A proof-of-concept
demonstration of a hybrid computing architecture for domain-specific quantum
computing is described.
In text/plain
format
Archived Files and Locations
application/pdf 1.1 MB
file_66jnkfwsgzakdiu4c6m7mzwtii
|
arxiv.org (repository) web.archive.org (webarchive) |
2106.08681v1
access all versions, variants, and formats of this works (eg, pre-prints)