Mathematical approaches for characterization, control, calibration and validation of a quantum computing device

• URL: http://arxiv.org/abs/2301.10712v1
• Date: Wed, 25 Jan 2023 17:23:29 GMT
• Title: Mathematical approaches for characterization, control, calibration and validation of a quantum computing device
• Authors: Zhichao Peng, Daniel Appelo, N. Anders Petersson, Fortino Garcia and Yujin Cho
• Abstract summary: This report walks through the entire procedure from the characterization and optimal control of a qudit device to the validation of the results. A goal of the report is to provide an introduction for students and researchers, especially computational mathematicians, who are interested in but new to quantum computing.
• Score: 0.4499833362998487
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum computing has received significant amounts of interest from many different research communities over the last few years. Although there are many introductory texts that focus on the algorithmic parts of quantum computing, there is a dearth of publications that describe the modeling, calibration and operation of current quantum computing devices. One aim of this report is to fill that void by providing a case study that walks through the entire procedure from the characterization and optimal control of a qudit device at Lawrence Livermore National Laboratory (LLNL) to the validation of the results. A goal of the report is to provide an introduction for students and researchers, especially computational mathematicians, who are interested in but new to quantum computing. Both experimental and mathematical aspects of this procedure are discussed. We present a description of the LLNL QuDIT testbed, the mathematical models that are used to describe it, and the numerical methods that are used to to design optimal controls. We also present experimental and computational methods that can be used to characterize a quantum device. Finally, an experimental validation of an optimized control pulse is presented, which relies on the accuracy of the characterization and the optimal control methodologies.

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)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• A Herculean task: Classical simulation of quantum computers [4.12322586444862]
  This work reviews the state-of-the-art numerical simulation methods that emulate quantum computer evolution under specific operations. We focus on the mainstream state-vector and tensor-network paradigms while briefly mentioning alternative methods.
  arXiv  Detail & Related papers  (2023-02-17T13:59:53Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Adiabatic based Algorithm for SAT: a comprehensive algorithmic description [2.2688530041645856]
  Quantum approximates take advantage of alternation between a Hamiltonian defining the problem to solve and a mixing Hamiltonian. The adiabatic theorem initially defined in quantum physic allows to compute a solution for the Schr"odinger equation.
  arXiv  Detail & Related papers  (2022-07-20T15:42:06Z)
• Markovian Noise Modelling and Parameter Extraction Framework for Quantum Devices [0.0]
  This work provides a new hardware-agnostic framework for modelling the Markovian noise and dynamics of quantum systems. As an example, the application and performance of this framework is demonstrated on IBM Quantum computers.
  arXiv  Detail & Related papers  (2022-02-09T14:06:53Z)
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks [2.28438857884398]
  We introduce quantum algorithms to solve tasks such as matrix product or distance estimation. These results are then used to develop new quantum algorithms for unsupervised machine learning. We will also present new quantum algorithms for neural networks, or deep learning.
  arXiv  Detail & Related papers  (2021-11-05T16:36:09Z)
• Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations [0.20999222360659606]
  We explore the quantum volume test to better understand its design aspects, sensitivity to errors, passing criteria, and what passing implies about a quantum computer. We present an efficient algorithm for estimating the expected heavy output probability under different error models and compiler optimization options. We discuss what the quantum volume test implies about a quantum computer's practical or operational abilities especially in terms of quantum error correction.
  arXiv  Detail & Related papers  (2021-10-27T23:05:26Z)
• Quantum-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)
• Nearest Centroid Classification on a Trapped Ion Quantum Computer [57.5195654107363]
  We design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations. We experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data.
  arXiv  Detail & Related papers  (2020-12-08T01:10:30Z)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.