2019
DOI: 10.1088/2058-9565/ab18dd
|View full text |Cite
|
Sign up to set email alerts
|

Hamiltonian quantum computing with superconducting qubits

Abstract: We consider how the Hamiltonian Quantum Computing scheme introduced in [New Journal of Physics, vol. 18, p. 023042, 2016] can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive cross-Kerr and weak flip-flop or hopping interactions and we detail how this can be achieved. Our proposal uses a new electric circuit for obtaining the attractive cross-Kerr coupling between transmons via a dipolelike element. We discuss and numerica… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 60 publications
(156 reference statements)
0
10
0
Order By: Relevance
“…In Refs. [16,58] two physical qubits represent a site in a lattice, which can host a mobile logical qubit. The state |00 represents a vacant site, while the states |01 and |10 represent the two internal states of a present logical qubit.…”
Section: Discussionmentioning
confidence: 99%
“…In Refs. [16,58] two physical qubits represent a site in a lattice, which can host a mobile logical qubit. The state |00 represents a vacant site, while the states |01 and |10 represent the two internal states of a present logical qubit.…”
Section: Discussionmentioning
confidence: 99%
“…First, computing correlators up to constant additive errors on ground states of quasi-local Hamiltonians is -hard by the Feynman–Kitaev construction ( 38 ). Furthermore this remains true for several classes of local observables and local Hamiltonians, including one-local observables measured on ground states of nearest-neighbor two-local Hamiltonians on qubits ( 39 , 40 ) and two-local observables measured on ground states of translation invariant nearest-neighbor two-local Hamiltonians with local dimension three ( 41 ).…”
Section: On the Computational Complexity Of The Dsfmentioning
confidence: 99%
“…First, computing correlators up to constant additive errors on ground states of quasi-local Hamiltonians is BQP-hard by the Feynman-Kitaev construction [47]. Furthermore this remains true for several classes of local observables and local Hamiltonians, including one-local observables measured on ground states of nearest-neighbour two-local Hamiltonians on qubits [48,49], and two-local observables measured on ground states of translation invariant nearest-neighbour two-local Hamiltonians with local dimension three [50].…”
Section: A Hardness For Estimating Correlators On Ground Statesmentioning
confidence: 99%