Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems

• URL: http://arxiv.org/abs/2308.12423v4
• Date: Thu, 12 Sep 2024 23:15:36 GMT
• Title: Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
• Authors: Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall, Mark Hodson, Maxime Dupont, Bram Evert, James Sud, M. Sohaib Alam, Zhihui Wang, Stephen Jeffrey, Bhuvanesh Sundar, P. Aaron Lott, Shon Grabbe, Eleanor G. Rieffel, Matthew J. Reagor, Davide Venturelli,
• Abstract summary: We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hamiltonian in each layer. We report performance significantly better than using a random guess oracle for circuits involving up to approx 5000 two-qubit and approx 5000 one-qubit native gates.
• Score: 12.220619768140903
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hamiltonian in each layer. We treat gate orderings as a variational parameter and observe that doing so can provide significant performance boosts in experiments. We carried out experimental runs of a compilation-optimized implementation of fully-connected Sherrington-Kirkpatrick Hamiltonians on a 50-qubit linear-chain subsystem of Rigetti Aspen-M-3 transmon processor. Our results indicate that, for the best circuit designs tested, the average performance at optimized angles and gate orderings increases with circuit depth (using more parameters), despite the presence of a high level of noise. We report performance significantly better than using a random guess oracle for circuits involving up to approx 5000 two-qubit and approx 5000 one-qubit native gates. We additionally discuss various takeaways of our results toward more effective utilization of current and future quantum processors for optimization.

Related papers

• Performance Characterization of a Multi-Module Quantum Processor with Static Inter-Chip Couplers [63.42120407991982]
  Three-dimensional integration technologies such as flip-chip bonding are a key prerequisite to realize large-scale superconducting quantum processors. We present a design for a multi-chip module comprising one carrier chip and four qubit modules. Measuring two of the qubits, we analyze the readout performance, finding a mean three-level state-assignment error of $9 times 10-3$ in 200 ns. We demonstrate a controlled-Z two-qubit gate in 100 ns with an error of $7 times 10-3$ extracted from interleaved randomized benchmarking.
  arXiv  Detail & Related papers  (2025-03-16T18:32:44Z)
• Gaussian process model kernels for noisy optimization in variational quantum algorithms [0.0]
  Variational Quantum Algorithms (VQAs) aim at solving classical or quantum optimization problems by optimizing parametrized trial states on a quantum device, based on the outcomes of noisy projective measurements. We introduce trigonometric kernels, inspired by the observation that typical VQA cost functions display oscillatory behaviour with only few frequencies.
  arXiv  Detail & Related papers  (2024-12-17T19:05:32Z)
• EPS-MoE: Expert Pipeline Scheduler for Cost-Efficient MoE Inference [49.94169109038806]
  This paper introduces EPS-MoE, a novel expert pipeline scheduler for MoE that surpasses the existing parallelism schemes. Our results demonstrate at most 52.4% improvement in prefill throughput compared to existing parallel inference methods.
  arXiv  Detail & Related papers  (2024-10-16T05:17:49Z)
• A General Framework for Gradient-Based Optimization of Superconducting Quantum Circuits using Qubit Discovery as a Case Study [0.19528996680336308]
  We present a comprehensive framework for the gradient-based optimization of superconducting quantum circuits. We apply this framework to the qubit discovery problem, demonstrating its effectiveness in identifying qubit designs with superior performance metrics.
  arXiv  Detail & Related papers  (2024-08-22T19:46:50Z)
• End-to-End Protocol for High-Quality QAOA Parameters with Few Shots [2.906880059847219]
  We develop an end-to-end protocol that combines multiple parameter settings and fine-tuning techniques. We implement a trapped-ion processor using up to 32 qubits and 5 QAOA layers. We demonstrate that the pipeline is robust to small amounts of hardware noise.
  arXiv  Detail & Related papers  (2024-08-01T13:39:40Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Performance Embeddings: A Similarity-based Approach to Automatic Performance Optimization [71.69092462147292]
  Performance embeddings enable knowledge transfer of performance tuning between applications. We demonstrate this transfer tuning approach on case studies in deep neural networks, dense and sparse linear algebra compositions, and numerical weather prediction stencils.
  arXiv  Detail & Related papers  (2023-03-14T15:51:35Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Quantum optimization via four-body Rydberg gates [0.0]
  We propose and analyze a fast, high fidelity four-body Rydberg parity gate. Our gate relies on onetime-optimized adiabatic laser pulses and is fully programmable by adjusting two hold-times during operation. We demonstrate an implementation of the quantum approximate optimization algorithm (QAOA) for a small scale test problem.
  arXiv  Detail & Related papers  (2021-06-04T18:33:09Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Hessian-based optimization of constrained quantum control [0.0]
  gradient-based textscgrape algorithm is successfully applied in a wide range of different branches of quantum physics. We derive and implement exact $2mathrmnd$ order analytical derivatives of the coherent dynamics. We demonstrate performance improvements for both the best and average errors of constrained unitary gate synthesis on a circuit-textscqed system.
  arXiv  Detail & Related papers  (2020-06-01T13:31:06Z)
• Accelerating Quantum Approximate Optimization Algorithm using Machine Learning [6.735657356113614]
  We propose a machine learning based approach to accelerate quantum approximate optimization algorithm (QAOA) implementation. QAOA is a quantum-classical hybrid algorithm to prove the so-called quantum supremacy. We show that the proposed approach can curtail the number of optimization iterations by up to 65.7%) from an analysis performed with 264 flavors of graphs.
  arXiv  Detail & Related papers  (2020-02-04T02:21:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.