Automatic virtual voltage extraction of a 2x2 array of quantum dots with machine learning

• URL: http://arxiv.org/abs/2012.03685v2
• Date: Wed, 26 May 2021 10:07:11 GMT
• Title: Automatic virtual voltage extraction of a 2x2 array of quantum dots with machine learning
• Authors: Giovanni A. Oakes, Jingyu Duan, John J. L. Morton, Alpha Lee, Charles G. Smith and M. Fernando Gonzalez Zalba
• Abstract summary: Cross-coupling in quantum dots can be substantial, making it difficult to control each quantum dot independently. We develop a theoretical framework to mitigate the effect of cross-capacitances in 2x2 arrays of quantum dots, that can be directly extended to 2xN arrays.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Spin qubits in quantum dots are a compelling platform for fault-tolerant quantum computing due to the potential to fabricate dense two-dimensional arrays with nearest neighbour couplings, a requirement to implement the surface code. However, due to the proximity of the surface gate electrodes, cross-coupling capacitances can be substantial, making it difficult to control each quantum dot independently. Increasing the number of quantum dots increases the complexity of the calibration process, which becomes impractical to do heuristically. Inspired by recent demonstrations of industrial-grade silicon quantum dot bilinear arrays, we develop a theoretical framework to mitigate the effect of cross-capacitances in 2x2 arrays of quantum dots, that can be directly extended to 2xN arrays. The method is based on extracting the gradients in gate voltage space of different charge transitions in multiple two-dimensional charge stability diagrams to determine the system's virtual voltages. To automate the process, we train an ensemble of regression models to extract the gradients from a Hough transformation of a stability diagram and validate the algorithm on simulated and experimental data of a 2x2 quantum dot array. Our method provides a completely automated tool to mitigate the effect of cross capacitances, which could be used to study cross capacitance variability across QDs in large bilinear arrays

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Simulating 2D topological quantum phase transitions on a digital quantum computer [3.727382912998531]
  Efficient preparation of many-body ground states is key to harnessing the power of quantum computers in studying quantum many-body systems. We propose a simple method to design exact linear-depth parameterized quantum circuits which prepare a family of ground states across topological quantum phase transitions in 2D. We show that the 2D isoTNS can also be efficiently simulated by a holographic quantum algorithm requiring only an 1D array of qubits.
  arXiv  Detail & Related papers  (2023-12-08T15:01:44Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer [0.0]
  Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications. Inspired by data-loading circuits developed for quantum machine learning, we propose an alternate paradigm that provides shallower, yet scalable $mathcalO(d log2N)$ two-qubit gate depth circuits to prepare such states with d-fermions.
  arXiv  Detail & Related papers  (2023-01-18T12:43:18Z)
• Double-bracket quantum algorithms for diagonalization [0.0]
  This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal evolutions which can be chosen variationally.
  arXiv  Detail & Related papers  (2022-06-23T15:13:46Z)
• Localized Quantum Chemistry on Quantum Computers [0.6649973446180738]
  Quantum chemistry calculations are typically limited by the computation cost that scales exponentially with the size of the system. We present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation.
  arXiv  Detail & Related papers  (2022-03-03T20:52:22Z)
• 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)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Gate reflectometry in dense quantum dot arrays [18.131612654397884]
  We perform gate-voltage pulsing and gate-based reflectometry measurements on a dense 2$times$2 array of silicon quantum dots fabricated in a 300-mm-wafer foundry. Our techniques may find use in the scaling of few-dot spin-qubit devices to large-scale quantum processors.
  arXiv  Detail & Related papers  (2020-12-08T23:51:19Z)

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.