2020
DOI: 10.1103/physrevapplied.13.034037
|View full text |Cite
|
Sign up to set email alerts
|

Demonstration of a Nonstoquastic Hamiltonian in Coupled Superconducting Flux Qubits

Abstract: Hamiltonian-based quantum computation is a class of quantum algorithms in which the problem is encoded in a Hamiltonian and the evolution is performed by a continuous transformation of the Hamiltonian. Universal adiabatic quantum computing, quantum simulation, and quantum annealing are examples of such algorithms. Up to now, all implementations of this approach have been limited to qubits coupled via a single degree of freedom. This gives rise to a stoquastic Hamiltonian that has no sign problem in quantum Mon… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
94
2

Year Published

2020
2020
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 65 publications
(98 citation statements)
references
References 40 publications
2
94
2
Order By: Relevance
“…In this subsection we briefly review the reduction method outlined in a recent work by Ozfidan et al [16]. This method starts by writing the low-energy part of the total circuit HamiltonianĤ e.m. , i.e.…”
Section: Approximate Rotation Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…In this subsection we briefly review the reduction method outlined in a recent work by Ozfidan et al [16]. This method starts by writing the low-energy part of the total circuit HamiltonianĤ e.m. , i.e.…”
Section: Approximate Rotation Methodsmentioning
confidence: 99%
“…R 1 must therefore be explicitly orthonormalised, for instance using the Gram-Schmidt procedure. This step is only justified if the columns of R 1 are already approximately orthonormal [16]. Since in our case orthogonality follows from normalisation, it suffices to check that…”
Section: Approximate Rotation Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Such a controllability is essential for the implementation of the QA. A potential problem is that the FQs used in the QA have a short coherence time such as tens of nano seconds [20]. Such a short coherence time could make it difficult to exploit the quantum advantage for the QA.…”
Section: Introductionmentioning
confidence: 99%