Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Quantum annealing with a network of all-to-all connected, two-photon driven Kerr nonlinear oscillators
arXiv
Authors: Shruti Puri, Christian Kraglund Andersen, Arne L. Grimsmo, Alexandre Blais
Year
2016
Paper ID
43409
Status
Preprint
Abstract Read
~2 min
Abstract Words
156
Citations
N/A
Abstract
Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research is consequently focussed towards developing noise-resilient annealers. Here we propose a new paradigm for quantum annealing with a scalable network of all-to-all connected, two-photon driven Kerr-nonlinear resonators. Each of these resonators encode an Ising spin in a robust degenerate subspace formed by two coherent states of opposite phases. The fully-connected optimization problem is mapped onto local fields driving the resonators, which are themselves connected by local four-body interactions. We describe an adiabatic annealing protocol in this system and analyze its performance in the presence of photon loss. Numerical simulations indicate substantial resilience to this noise channel, making it a promising platform for implementing a large scale quantum Ising machine. Finally, we propose a realistic implementation of this scheme in circuit QED.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2016 reference point for readers tracking recent quantum research.
- Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.