Improving performance of logical qubits by parameter tuning and topology compensation

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.

11 pages, 15 figures, accepted QCE20

References in corpus (6)

• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Scaling advantage in quantum simulation of geometrically frustrated magnets
• 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
• 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