Improving performance of logical qubits by parameter tuning and topology compensation
arXiv:2006.04913 · doi:10.1109/QCE49297.2020.00044
Abstract
Optimization or sampling of arbitrary pairwise Ising models, in a quantum annealing protocol of constrained interaction topology, can be enabled by a minor-embedding procedure. The logical problem of interest is transformed to a physical (device programmable) problem, where one binary variable is represented by a logical qubit consisting of multiple physical qubits. In this paper we discuss tuning of this transformation for the cases of clique, biclique, and cubic lattice problems on the D-Wave 2000Q quantum computer. We demonstrate parameter tuning protocols in spin glasses and channel communication problems, focusing on anneal duration, chain strength, and mapping from the result on physical qubits back to the logical space. Inhomogeneities in effective coupling strength arising from minor-embedding are shown to be mitigated by an efficient reweighting of programmed couplings, accounting for logical qubit topology.
arXiv comment11 pages, 15 figures, accepted QCE20
References in corpus (17)
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Defining and detecting quantum speedup
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Architectural considerations in the design of a superconducting quantum annealing processor
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Quantum Optimization of Fully-Connected Spin Glasses
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Searching for quantum speedup in quasistatic quantum annealers
- Scaling advantage in quantum simulation of geometrically frustrated magnets
- Quantum Annealing Correction with Minor Embedding
- Leveraging Quantum Annealing for Large MIMO Processing in Centralized Radio Access Networks
- Next-Generation Topology of D-Wave Quantum Processors
- Algorithm engineering for a quantum annealing platform
- Degeneracy, degree, and heavy tails in quantum annealing
- A Path Towards Quantum Advantage in Training Deep Generative Models with Quantum Annealers
Cited by in corpus (5)
- Advanced unembedding techniques for quantum annealers
- Quantum Annealers Chain Strengths: A Simple Heuristic to Set Them All
- Spatial correlations in the qubit properties of D-Wave 2000Q measured and simulated qubit networks
- Benchmarking Embedded Chain Breaking in Quantum Annealing
- Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time