Resonant Coupling Parameter Estimation with Superconducting Qubits
- URL: http://arxiv.org/abs/2008.12714v1
- Date: Fri, 28 Aug 2020 15:51:41 GMT
- Title: Resonant Coupling Parameter Estimation with Superconducting Qubits
- Authors: J. H. B\'ejanin, C. T. Earnest, Y. R. Sanders, M. Mariantoni
- Abstract summary: We show a method to efficiently learn the parameters of resonant interactions for quantum computers consisting of frequency-tunable superconducting qubits.
Our method is based on a significantly improved swap spectroscopy calibration.
We believe the method investigated will improve present medium-scale superconducting quantum computers and will also scale up to larger systems.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Today's quantum computers are comprised of tens of qubits interacting with
each other and the environment in increasingly complex networks. In order to
achieve the best possible performance when operating such systems, it is
necessary to have accurate knowledge of all parameters in the quantum computer
Hamiltonian. In this article, we demonstrate theoretically and experimentally a
method to efficiently learn the parameters of resonant interactions for quantum
computers consisting of frequency-tunable superconducting qubits. Such
interactions include, for example, those to other qubits, resonators, two-level
state defects, or other unwanted modes. Our method is based on a significantly
improved swap spectroscopy calibration and consists of an offline data
collection algorithm, followed by an online Bayesian learning algorithm. The
purpose of the offline algorithm is to detect and roughly estimate resonant
interactions from a state of zero knowledge. It produces a square-root
reduction in the number of measurements. The online algorithm subsequently
refines the estimate of the parameters to comparable accuracy as traditional
swap spectroscopy calibration, but in constant time. We perform an experiment
implementing our technique with a superconducting qubit. By combining both
algorithms, we observe a reduction of the calibration time by one order of
magnitude. We believe the method investigated will improve present medium-scale
superconducting quantum computers and will also scale up to larger systems.
Finally, the two algorithms presented here can be readily adopted by
communities working on different physical implementations of quantum computing
architectures.
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) - Multimodal deep representation learning for quantum cross-platform
verification [60.01590250213637]
Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms.
We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities.
We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
arXiv Detail & Related papers (2023-11-07T04:35:03Z) - Analog quantum variational embedding classifier [8.445680783099196]
We propose a gate-based variational embedding classifier based on an analog quantum computer.
We find the performance of our classifier can be increased by increasing the number of qubits until the performance saturates and fluctuates.
Our algorithm presents the possibility of using current quantum annealers for solving practical machine-learning problems.
arXiv Detail & Related papers (2022-11-04T20:58:48Z) - 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) - Quantum simulation of dissipative collective effects on noisy quantum
computers [0.0]
We put forward the first fully quantum simulation of dissipative collective phenomena on a real quantum computer.
The quantum simulation is based on the recently introduced multipartite collision model.
We implement the algorithm on some IBM quantum computers to simulate superradiance and subradiance between a pair of qubits.
arXiv Detail & Related papers (2022-01-27T15:50:58Z) - Dispersive qubit readout with machine learning [0.08399688944263842]
Open quantum systems can undergo dissipative phase transitions, and their critical behavior can be exploited in sensing applications.
A recently introduced measurement protocol uses the parametric (two-photon driven) Kerr resonator's driven-dissipative phase transition to reach single-qubit detection fidelity of 99.9%.
We use machine learning-based classification algorithms to extract information from this critical dynamics.
arXiv Detail & Related papers (2021-12-10T04:25:43Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Efficient realization of quantum algorithms with qudits [0.70224924046445]
We propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits)
Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor.
We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set.
arXiv Detail & Related papers (2021-11-08T11:09:37Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry.
New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications.
We present a novel technique to reconstruct the transfer matrix of linear optical networks.
arXiv Detail & Related papers (2020-10-01T16:04:22Z)
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.