Related papers: A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark

A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark

URL: http://arxiv.org/abs/2111.00044v1
Date: Fri, 29 Oct 2021 18:52:46 GMT
Title: A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark
Authors: Bryan T. Gard and Adam M. Meier
Abstract summary: We propose and implement a practical, application-based benchmark for testbed quantum computing devices. Our protocol calculates the energy of the ground state in the single particle subspace of a 1-D Fermi Hubbard model. We demonstrate and analyze the benchmark performance on superconducting and ion trap testbed hardware from three hardware vendors and with up to 24 qubits.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: In order to quantify the relative performance of different testbed quantum computing devices, it is useful to benchmark them using a common protocol. While some benchmarks rely on the performance of random circuits and are generic in nature, here we instead propose and implement a practical, application-based benchmark. In particular, our protocol calculates the energy of the ground state in the single particle subspace of a 1-D Fermi Hubbard model, a problem which is efficient to solve classically. We provide a quantum ansatz for the problem that is provably able to probe the full single particle subspace for a general length 1-D chain and scales efficiently in number of gates and measurements. Finally, we demonstrate and analyze the benchmark performance on superconducting and ion trap testbed hardware from three hardware vendors and with up to 24 qubits.

Related papers

Certifying almost all quantum states with few single-qubit measurements [0.9558392439655012]
We show that almost all n-qubit target states can be certified from only O(n2) single-qubit measurements. We show that such verified representations can be used to efficiently predict highly non-local properties.
arXiv Detail & Related papers (2024-04-10T18:21:11Z)
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)
Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
arXiv Detail & Related papers (2022-11-07T12:00:45Z)
Testing quantum computers with the protocol of quantum state matching [0.0]
The presence of noise in quantum computers hinders their effective operation. We suggest the application of the so-called quantum state matching protocol for testing purposes. For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume.
arXiv Detail & Related papers (2022-10-18T08:25:34Z)
Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z)
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)
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)
Coherent randomized benchmarking [68.8204255655161]
We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
arXiv Detail & Related papers (2020-10-26T18:00:34Z)
Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
An application benchmark for fermionic quantum simulations [0.0]
It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. We propose using the one-dimensional Fermi-Hubbard model as an application benchmark for variational quantum simulations on near-term quantum devices.
arXiv Detail & Related papers (2020-03-04T02:23:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.