Unified evolutionary optimization for high-fidelity spin qubit operations

• URL: http://arxiv.org/abs/2503.12256v1
• Date: Sat, 15 Mar 2025 20:49:34 GMT
• Title: Unified evolutionary optimization for high-fidelity spin qubit operations
• Authors: Sam R. Katiraee-Far, Yuta Matsumoto, Brennan Undseth, Maxim De Smet, Valentina Gualtieri, Christian Ventura Meinersen, Irene Fernandez de Fuentes, Kenji Capannelli, Maximilian Rimbach-Russ, Giordano Scappucci, Lieven M. K. Vandersypen, Eliska Greplova,
• Abstract summary: We develop a unified global optimization-driven automated calibration routine on a six dot semiconductor quantum processor.<n>We optimize readout, shuttling and single-qubit quantum gates by tailoring task-specific cost functions and tuning parameters based on the underlying physics of each operation.<n>The flexibility of our gradient-free closed loop algorithmic procedure allows for seamless application across diverse qubit functionalities.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Developing optimal strategies to calibrate quantum processors for high-fidelity operation is one of the outstanding challenges in quantum computing today. Here, we demonstrate multiple examples of high-fidelity operations achieved using a unified global optimization-driven automated calibration routine on a six dot semiconductor quantum processor. Within the same algorithmic framework we optimize readout, shuttling and single-qubit quantum gates by tailoring task-specific cost functions and tuning parameters based on the underlying physics of each operation. Our approach reaches systematically $99\%$ readout fidelity, $>99\%$ shuttling fidelity over an effective distance of 10$\mu$m, and $>99.5\%$ single-qubit gate fidelity on timescales similar or shorter compared to those of expert human operators. The flexibility of our gradient-free closed loop algorithmic procedure allows for seamless application across diverse qubit functionalities while providing a systematic framework to tune-up semiconductor quantum devices and enabling interpretability of the identified optimal operation points.

Related papers

• Evaluating Mutation Techniques in Genetic Algorithm-Based Quantum Circuit Synthesis [6.122499977051124]
  Genetic algorithms (GAs) provide a promising approach for efficient quantum circuit synthesis. This work examines the impact of various mutation strategies within a GA framework for quantum circuit synthesis.
  arXiv  Detail & Related papers  (2025-04-08T20:14:35Z)
• Efficient Online Quantum Circuit Learning with No Upfront Training [1.0159681653887238]
  We propose a surrogate-based method for optimizing parameterized quantum circuits with few calls to a quantum computer.<n>For 16-qubit random 3-regular Max-Cut problems solved using the QAOA ansatz, we find that our method outperforms the prior state of the art.
  arXiv  Detail & Related papers  (2025-01-08T17:30:45Z)
• Single-Layer Digitized-Counterdiabatic Quantum Optimization for $p$-spin Models [8.463477025989542]
  We take advantage of a digitized-counterdiabatic quantum optimization (DCQO) algorithm to find an optimal solution of the $p$-spin model up to 4-local interactions. By further optimizing parameters using variational methods, we solve with unit accuracy 2-spin, 3-spin, and 4-spin problems for $100%$, $93%$, and $83%$ of instances, respectively.
  arXiv  Detail & Related papers  (2023-11-11T22:49:16Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Quantum Architecture Search for Quantum Monte Carlo Integration via Conditional Parameterized Circuits with Application to Finance [0.0]
  Classical Monte Carlo algorithms can theoretically be sped up on a quantum computer by employing amplitude estimation (AE) We develop a straightforward approach based on pretraining parameterized quantum circuits. We show how they can be transformed into their conditional variant, making them usable as a subroutine in an AE algorithm.
  arXiv  Detail & Related papers  (2023-04-18T07:56:57Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm [0.0]
  Trading fidelity for scale enables approximate classical simulators to run quantum circuits beyond exact methods. We characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function it seeks to minimize. We benchmark the performance of quantum hardware in a realistic setup.
  arXiv  Detail & Related papers  (2022-06-13T17:45:59Z)
• Quantum Optimal Control via Semi-Automatic Differentiation [0.0]
  We develop a framework that combines gradient-based methods of quantum optimal control with automatic differentiation. The approach allows to optimize practically any computable functional. We illustrate and benchmark the use of semi-automatic differentiation for the optimization of perfectly entangling quantum gates on superconducting qubits.
  arXiv  Detail & Related papers  (2022-05-27T16:40:00Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• 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)

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.