As progress on experimental quantum processors continues to advance, the problem of verifying the correct operation of such devices is becoming a pressing concern. The recent discovery of protocols for verifying computation performed by entangled but non-communicating quantum processors holds the promise of certifying the correctness of arbitrary quantum computations in a fully device-independent manner. Unfortunately, all known schemes have prohibitive overhead, with resources scaling as extremely high degree polynomials in the number of gates constituting the computation. Here we present a novel approach based on a combination of verified blind quantum computation and Bell state self-testing. This approach has dramatically reduced overhea...
Blind quantum computation allows a user to delegate a computation to an untrusted server while keepi...
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classica...
Quantum computers can, in theory, impressively reduce the time required to solve many pertinent prob...
As progress on experimental quantum processors continues to advance, the problem of verifying the co...
Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for t...
International audienceBlind quantum computing (BQC) allows a client to have a server carry out a qua...
We introduce a device-independent two-prover scheme in which a classical verifier is able to use a s...
With experimental quantum computing technologies now in their infancy, the search for efficient mean...
Self-testing is a method to characterise an arbitrary quantum system based only on its classical inp...
With the recent availability of cloud quantum computing services, the question of verifying quantum ...
45 pages, 9 figuresWith the recent availability of cloud quantum computing services, the question of...
The promise of scalable quantum technology appears more realistic, after recent advances in both th...
International audienceRecent developments have brought the possibility of achieving scalable quantum...
We present two verification protocols where the correctness of a “target” computation is checked by ...
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classica...
Blind quantum computation allows a user to delegate a computation to an untrusted server while keepi...
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classica...
Quantum computers can, in theory, impressively reduce the time required to solve many pertinent prob...
As progress on experimental quantum processors continues to advance, the problem of verifying the co...
Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for t...
International audienceBlind quantum computing (BQC) allows a client to have a server carry out a qua...
We introduce a device-independent two-prover scheme in which a classical verifier is able to use a s...
With experimental quantum computing technologies now in their infancy, the search for efficient mean...
Self-testing is a method to characterise an arbitrary quantum system based only on its classical inp...
With the recent availability of cloud quantum computing services, the question of verifying quantum ...
45 pages, 9 figuresWith the recent availability of cloud quantum computing services, the question of...
The promise of scalable quantum technology appears more realistic, after recent advances in both th...
International audienceRecent developments have brought the possibility of achieving scalable quantum...
We present two verification protocols where the correctness of a “target” computation is checked by ...
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classica...
Blind quantum computation allows a user to delegate a computation to an untrusted server while keepi...
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classica...
Quantum computers can, in theory, impressively reduce the time required to solve many pertinent prob...