Characterizing quantum processors using discrete time crystals
- URL: http://arxiv.org/abs/2301.07625v1
- Date: Wed, 18 Jan 2023 16:08:50 GMT
- Title: Characterizing quantum processors using discrete time crystals
- Authors: Victoria Zhang and Paul D. Nation
- Abstract summary: We present a method for characterizing the performance of noisy quantum processors using discrete time crystals.
We construct small sets of qubit layouts that cover the full topology of a target system, and execute our metric over these sets on a wide range of IBM Quantum processors.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present a method for characterizing the performance of noisy quantum
processors using discrete time crystals. Deviations from ideal persistent
oscillatory behavior give rise to numerical scores by which relative quantum
processor capabilities can be measured. We construct small sets of qubit
layouts that cover the full topology of a target system, and execute our metric
over these sets on a wide range of IBM Quantum processors. We show that there
is a large variability in scores, not only across multiple processors, but
between different circuit layouts over individual devices. The stability of
results is also examined. Our results suggest that capturing the true
performance characteristics of a quantum system requires interrogation over the
full device, rather than isolated subgraphs. Moreover, the disagreement between
our results and other metrics indicates that benchmarks computed infrequently
are not indicative of the real-world performance of a quantum processor. This
method is platform agnostic, simple to implement, and scalable to any number of
qubits forming a linear-chain, while simultaneously allowing for identifying
ill-performing regions of a device at the individual qubit level.
Related papers
- Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
We show that a quantum processor can correctly solve the basic classification task considered.
With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
arXiv Detail & Related papers (2024-06-17T18:20:51Z) - 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) - Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
We numerically simulate and characterize the operation of various quantum processors.
We identify and assess quantum complexity by comparing the performance of each device against benchmark lines.
We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
arXiv Detail & Related papers (2023-04-10T23:01:10Z) - 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) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
We introduce new tools in qutip-qip, QuTiP's quantum information processing package.
These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features.
We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
arXiv Detail & Related papers (2021-05-20T17:06:52Z) - Scalable Benchmarks for Gate-Based Quantum Computers [5.735035463793008]
We develop and release an advanced quantum benchmarking framework.
It measures the performance of universal quantum devices in a hardware-agnostic way.
We present the benchmark results of twenty-one different quantum devices from IBM, Rigetti and IonQ.
arXiv Detail & Related papers (2021-04-21T18:00:12Z) - 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) - Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow [7.619626059034881]
We propose an efficient scheme for quantum circuit equivalence checking.
The proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less.
arXiv Detail & Related papers (2020-09-04T19:58:53Z) - Quantum Divide and Compute: Hardware Demonstrations and Noisy
Simulations [0.9659642285903421]
We show a recently introduced method that breaks a circuit into smaller subcircuits or fragments.
This makes it possible to run circuits that are either too wide or too deep for a given quantum processor.
We investigate the behavior of the method on one of IBM's 20-qubit superconducting quantum processors.
arXiv Detail & Related papers (2020-05-26T17:08:13Z)
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.