Robust quantum optimizer with full connectivity

Nigg, Simon E. and Lörch, Niels and Tiwari, Rakesh P.. (2017) Robust quantum optimizer with full connectivity. Science Advances, 3 (4). e1602273.

Full text not available from this repository.

Official URL: https://edoc.unibas.ch/68063/

Downloads: Statistics Overview


Quantum phenomena have the potential to speed up the solution of hard optimization problems. For example, quantum annealing, based on the quantum tunneling effect, has recently been shown to scale exponentially better with system size than classical simulated annealing. However, current realizations of quantum annealers with superconducting qubits face two major challenges. First, the connectivity between the qubits is limited, excluding many optimization problems from a direct implementation. Second, decoherence degrades the success probability of the optimization. We address both of these shortcomings and propose an architecture in which the qubits are robustly encoded in continuous variable degrees of freedom. By leveraging the phenomenon of flux quantization, all-to-all connectivity with sufficient tunability to implement many relevant optimization problems is obtained without overhead. Furthermore, we demonstrate the robustness of this architecture by simulating the optimal solution of a small instance of the nondeterministic polynomialtime hard (NP-hard) and fully connected number partitioning problem in the presence of dissipation.
Faculties and Departments:05 Faculty of Science > Departement Physik > Physik > Theoretische Physik (Bruder)
UniBasel Contributors:Lörch, Niels and Nigg, Simon and Tiwari, Rakesh
Item Type:Article, refereed
Article Subtype:Research Article
Note:Publication type according to Uni Basel Research Database: Journal article
Identification Number:
Last Modified:29 Jan 2019 18:39
Deposited On:29 Jan 2019 18:39

Repository Staff Only: item control page