Emulating Quantum Circuits With Generalized Ising Machines
The primary objective of this paper is to present an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits which can take on one of two values 0 and 1. The first <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math...
Main Authors: | Shuvro Chowdhury, Kerem Y. Camsari, Supriyo Datta |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10278418/ |
Similar Items
-
Grassmannization of the 3D Ising Model
by: E. Martello, et al.
Published: (2019-06-01) -
Commuting quantum circuits and complexity of Ising partition functions
by: Keisuke Fujii, et al.
Published: (2017-01-01) -
Hardware emulation of quantum circuits based on Toffoli gates
by: Jaime Velasco-Medina, et al.
Published: (2014-05-01) -
Quantum correlations in the Kerr Ising model
by: M J Kewming, et al.
Published: (2020-01-01) -
Autonomous Probabilistic Coprocessing With Petaflips per Second
by: Brian Sutton, et al.
Published: (2020-01-01)