Cross-verification of independent quantum devices

@article{Greganti2019CrossverificationOI,
  title={Cross-verification of independent quantum devices},
  author={C. Greganti and Tommaso F. Demarie and Martin Ringbauer and J A Jones and Valeria Saggio and I. Alonso Calafell and Lee A. Rozema and Alexander Erhard and Michael Meth and Lukas Postler and Roman Stricker and Philipp Schindler and R Blatt and Thomas Monz and Philip Walther and Joseph Fitzsimons},
  journal={2021 Conference on Lasers and Electro-Optics Europe \& European Quantum Electronics Conference (CLEO/Europe-EQEC)},
  year={2019},
  pages={1-1}
}
  • C. GregantiT. F. Demarie J. Fitzsimons
  • Published 23 May 2019
  • Computer Science
  • 2021 Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)
Today’s intermediate-scale quantum devices are on the brink of outperforming their classical counterparts. Yet these devices remain noisy, and with no trusted classical computers to check their results, we are left with a dire need to verify that they indeed perform as intended. The standard approach to this problem is to benchmark the performance of the individual building blocks using techniques such as quantum process tomography or randomized benchmarking and then extrapolate to the full… 
[PDF] Semantic Reader
9 Citations
Background Citations
3
Methods Citations
1

Figures from this paper

9 Citations

Cross-platform comparison of arbitrary quantum states

A cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems that allow for scaling to larger systems as compared to full quantum state tomography.

Distributed Quantum inner product estimation

The sample complexity of the cross-platform verification task, which involves two players Alice and Bob who have k copies of unknown states ρ,σ, is settled, showing that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting.

Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack

3 "application-motivated" circuit classes for benchmarking are proposed, showing that noise-aware compilation strategies may be beneficial, and that device connectivity and noise levels play a crucial role in the performance of the system according to the authors' benchmarks.

A compiler for universal photonic quantum computers

A pipeline to convert a QASM circuit into a graph representation named measurement-graph (m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer, and optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.

Practical verification protocols for analog quantum simulators

A set of experimentally-motivated verification protocols for analog quantum simulators are introduced, discussing their sensitivity to a variety of error sources and their scalability to larger system sizes.

Quantum information processing with mixed-species ion crystals

Trapped ions are among the leading platforms for the realization of scalable quantum information processing (QIP). A hybrid system composed of different species of ions extends the control…

Towards experimental classical verification of quantum computation

Roman Stricker,1 Jose Carrasco,2 Martin Ringbauer,1 Lukas Postler,1 Michael Meth,1 Claire Edmunds,1 Philipp Schindler,1 Rainer Blatt,1, 3 Peter Zoller,2, 3 Barbara Kraus,2 and Thomas Monz1, 4…

Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics

Heralded entanglement between solid-state qubits separated by three metres shows good contact between the qubits.

Intelligent certification for quantum simulators via machine learning

This work proposes Ab initio end-to-end machine learning certification protocol briefly named MLCP, which paves the way for large-scale intelligent certification of quantum simulators and can be extended onto an artificial intelligence center to offer easily accessible services for local quantumSimulation in the noisy intermediate-size quantum (NISQ) era.

References

SHOWING 1-10 OF 42 REFERENCES

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of…

Classical command of quantum systems

A scheme is described that can be used to determine the initial state and to classically command the system to evolve according to desired dynamics, and makes it possible to test whether a claimed quantum computer is truly quantum.

Classical Verification of Quantum Computations

  • U. Mahadev
  • Computer Science
    2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which…

Single-copy entanglement detection

A method for entanglement detection that requires only single copies of multi-partite quantum states, based on the success probability of a suitably designed experimental run, which is exponentially suppressed in the system size for separable states, making it useful for future applications based on large entangled states.

Demonstration of Blind Quantum Computing

An experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer is presented and the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server is exploited.

Universality of quantum computation with cluster states and (X, Y)-plane measurements

This work examines the question of whether the requirement for Z measurements can be dropped while maintaining universality in MBQC and answers this question in the affirmative by showing that universality is possible in this scenario.

Characterizing large-scale quantum computers via cycle benchmarking

Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the…

Measurement-based quantum computation

Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics are harnessed and exploited. A number of models of quantum computation…

Experimental comparison of two quantum computing architectures

It is shown that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits, and suggested that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources

This work presents two protocols for a classical verifier to verifiably delegate a quantum computation to two non-communicating but entangled quantum provers, and achieves near-optimal complexity in terms of the total resources employed by the verifier and the honest provers.