Programmable Superpositions of Ising Configurations

Abstract

We present a framework to prepare superpositions of bit strings, i.e., many-body spin configurations, with deterministic programmable probabilities. The spin configurations are encoded in the degenerate ground states of the lattice-gauge representation of an all-to-all connected Ising spin glass. The ground state manifold is invariant under variations of the gauge degrees of freedom, which take the form of four-body parity constraints. Our framework makes use of these degrees of freedom by individually tuning them to dynamically prepare programmable superpositions. The dynamics combines an adiabatic protocol with controlled diabatic transitions. We derive an effective model that allows one to determine the control parameters efficiently even for large system sizes.

published version, 12 pages, 4 figures

References in corpus (9)

• Probing many-body dynamics on a 51-atom quantum simulator
• Quantum random access memory
• Architectures for a quantum random access memory
• Engineering the quantum states of light in a Kerr-nonlinear resonator by two-photon driving
• Minimizing irreversible losses in quantum systems by local counter-diabatic driving
• A Coherent Quantum Annealer with Rydberg Atoms
• Exponentially-Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians
• Shortcuts to adiabaticity using flow fields
• Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer

Cited by in corpus (18)

• Perspectives of quantum annealing: Methods and implementations
• Circuit-Based Quantum Random Access Memory for Classical Data
• The theory of the quantum kernel-based binary classifier
• Polymer Physics by Quantum Computing
• Uncertain fate of fair sampling in quantum annealing
• Machine learning \& artificial intelligence in the quantum domain
• Rydberg blockade based parity quantum optimization
• Sampling on NISQ Devices: "Who's the Fairest One of All?"
• Universal Parity Quantum Computing
• Sampling Rare Conformational Transitions with a Quantum Computer
• Quantum Expectation-Maximization Algorithm
• Parallel quantum trajectories via forking for sampling without redundancy
• Parity Quantum Optimization: Encoding Constraints
• Fair Sampling Error Analysis on NISQ Devices
• Applications of Universal Parity Quantum Computation
• Designing ground states of Hopfield networks for quantum state preparation
• Graph minor embedding can affect sampling degenerate ground states using quantum annealing
• Four-body coupler for superconducting qubits based on Josephson parametric oscillators