Estimation of Convex Polytopes for Automatic Discovery of Charge State Transitions in Quantum Dot Arrays

• URL: http://arxiv.org/abs/2108.09133v1
• Date: Fri, 20 Aug 2021 12:07:10 GMT
• Title: Estimation of Convex Polytopes for Automatic Discovery of Charge State Transitions in Quantum Dot Arrays
• Authors: Oswin Krause, Torbj{\o}rn Rasmussen, Bertram Brovang, Anasua Chatterjee, Ferdinand Kuemmeth
• Abstract summary: We present the first practical algorithm for controlling the transition of electrons in a spin qubit array. Our proposed algorithm uses active learning, to find the count, shapes and sizes of all facets of a given polytope. Our results show that we can reliably find the facets of the polytope, including small facets with sizes on the order of the measurement precision.
• Score: 27.32875035022296
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In spin based quantum dot arrays, a leading technology for quantum computation applications, material or fabrication imprecisions affect the behaviour of the device, which is compensated via tuning parameters. Automatic tuning of these device parameters constitutes a formidable challenge for machine-learning. Here, we present the first practical algorithm for controlling the transition of electrons in a spin qubit array. We exploit a connection to computational geometry and phrase the task as estimating a convex polytope from measurements. Our proposed algorithm uses active learning, to find the count, shapes and sizes of all facets of a given polytope. We test our algorithm on artifical polytopes as well as a real 2x2 spin qubit array. Our results show that we can reliably find the facets of the polytope, including small facets with sizes on the order of the measurement precision. We discuss the implications of the NP-hardness of the underlying estimation problem and outline design considerations, limitations and tuning strategies for controlling future large-scale spin qubit devices.

Related papers

• Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set [3.087342164520494]
  We present an implementation of the PAW with plane waves for quantum computation of the energy. We provide the quantum resources for energy estimation of a nitrogen-vacancy defect centre in diamond.
  arXiv  Detail & Related papers  (2024-08-06T12:56:10Z)
• Quantum Resonant Dimensionality Reduction and Its Application in Quantum Machine Learning [2.7119354495508787]
  We propose a quantum resonant dimension reduction (QRDR) algorithm based on the quantum resonant transition to reduce the dimension of input data. After QRDR, the dimension of input data $N$ can be reduced into desired scale $R$, and the effective information of the original data will be preserved. Our algorithm has the potential to be utilized in a variety of computing fields.
  arXiv  Detail & Related papers  (2024-05-21T09:26:18Z)
• Variational Quantum Linear Solver enhanced Quantum Support Vector Machine [3.206157921187139]
  We propose a novel approach called the Variational Quantum Linear solver (VQLS) enhanced QSVM. This is built upon our idea of utilizing the variational quantum linear solver to solve system of linear equations of a least squares-SVM on a NISQ device. The implementation of our approach is evaluated by an extensive series of numerical experiments with the Iris dataset.
  arXiv  Detail & Related papers  (2023-09-14T14:59:58Z)
• Robust estimation of the Quantum Fisher Information on a quantum processor [0.0]
  We present the experimental measurement of a series of lower bounds that converge to the quantum Fisher information (QFI) We estimate the QFI for Greenberg-Horne-Zeilinger states, observing genuine multipartite entanglement. We investigate the interplay between state optimization and noise induced by increasing the circuit depth.
  arXiv  Detail & Related papers  (2023-07-31T17:49:04Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Automatic virtual voltage extraction of a 2x2 array of quantum dots with machine learning [0.0]
  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.
  arXiv  Detail & Related papers  (2020-12-07T13:37:09Z)
• Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
  We review and extend the application of deep learning to quantum geometric control problems. We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems. Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
  arXiv  Detail & Related papers  (2020-06-19T19:12:14Z)

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.