ترغب بنشر مسار تعليمي؟ اضغط هنا

A volumetric framework for quantum computer benchmarks

54   0   0.0 ( 0 )
 نشر من قبل Kevin Young
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We propose a very large family of benchmarks for probing the performance of quantum computers. We call them volumetric benchmarks (VBs) because they generalize IBMs benchmark for measuring quantum volume cite{Cross18}. The quantum volume benchmark defines a family of square circuits whose depth $d$ and width $w$ are the same. A volumetric benchmark defines a family of rectangular quantum circuits, for which $d$ and $w$ are uncoupled to allow the study of time/space performance trade-offs. Each VB defines a mapping from circuit shapes -- $(w,d)$ pairs -- to test suites $mathcal{C}(w,d)$. A test suite is an ensemble of test circuits that share a common structure. The test suite $mathcal{C}$ for a given circuit shape may be a single circuit $C$, a specific list of circuits ${C_1ldots C_N}$ that must all be run, or a large set of possible circuits equipped with a distribution $Pr(C)$. The circuits in a given VB share a structure, which is limited only by designers creativity. We list some known benchmarks, and other circuit families, that fit into the VB framework: several families of random circuits, periodic circuits, and algorithm-inspired circuits. The last ingredient defining a benchmark is a success criterion that defines when a processor is judged to have passed a given test circuit. We discuss several options. Benchmark data can be analyzed in many ways to extract many properties, but we propose a simple, universal graphical summary of results that illustrates the Pareto frontier of the $d$ vs $w$ trade-off for the processor being benchmarked. [1] A. Cross, et al., Phys. Rev. A, 100, 032328, September 2019.



قيم البحث

اقرأ أيضاً

The problem of quantum test is formally addressed. The presented method attempts the quantum role of classical test generation and test set reduction methods known from standard binary and analog circuits. QuFault, the authors software package genera tes test plans for arbitrary quantum circuits using the very efficient simulator QuIDDPro[1]. The quantum fault table is introduced and mathematically formalized, and the test generation method explained.
Quantum computing, an innovative computing system carrying prominent processing rate, is meant to be the solutions to problems in many fields. Among these realms, the most intuitive application is to help chemical researchers correctly de-scribe stro ng correlation and complex systems, which are the great challenge in current chemistry simulation. In this paper, we will present a standalone quantum simulation tool for chemistry, ChemiQ, which is designed to assist people carry out chemical research or molecular calculation on real or virtual quantum computers. Under the idea of modular programming in C++ language, the software is designed as a full-stack tool without third-party physics or chemistry application packages. It provides services as follow: visually construct molecular structure, quickly simulate ground-state energy, scan molecular potential energy curve by distance or angle, study chemical reaction, and return calculation results graphically after analysis.
The availability of a universal quantum computer will have fundamental impact on a vast number of research fields and society as a whole. An increasingly large scientific and industrial community is working towards the realization of such a device. A n arbitrarily large quantum computer is best constructed using a modular approach. We present a blueprint for a trapped-ion based scalable quantum computer module which makes it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques and they are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength-radiation based quantum gate technology. To scale this microwave quantum computer architecture to an arbitrary size we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high-error-threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With only minor adjustments the proposed modules are also suitable for alternative trapped-ion quantum computer architectures, such as schemes using photonic interconnects.
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.
The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables funda mentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا