On the possibility of classical client blind quantum computing

Cojocaru, Alexandru; Colisson, Léo; Kashefi, Elham; Wallden, Petros

doi:10.48550/arxiv.1802.08759

Cited by 2 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, in the case of numerical experiments benchmarking the simulator itself the perfect run will be conducted using a brute force simulator while the noisy run will utilise the simulator of our [116]. 16 The exact expression has 2 t b , where…”

Section: Exemplifying the Numerical Experiments Design Methodologymentioning

confidence: 99%

“…While the Clifford gate set is not universal even for classical computations [86], adding just the T-gate to the set makes it universal for quantum computation. In [74], a classical simulator for the Clifford + T gate set, with run time exponential in the number of T-gates 16 but polynomial in the number of qubits and Clifford gates, is developed. This allows efficient simulation of circuits with a logarithmic number of T-gates.…”

Section: Step 4: Clifford + T Simulator Of Bravyi and Gossetmentioning

confidence: 99%

“…This is a sub case of the more general problem of verifying a quantum computation has been implemented as expected [7,8]. The general problem is solved if one allows either for the verifier 6 to have a small quantum computer [9][10][11][12], the verifier to interact classically with two non-communicating quantum devices (either both universal quantum provers [13] or one a universal quantum computer and one a measuring device [14]), or for computational complexity conjectures to be made [15,16]. While these are remarkable results, they require either, or both, many more qubits than are required by an unverified implementation of a computation, or for the verifier to have quantum capabilities and a quantum communication channel to and from the prover.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Methods for classically simulating noisy networked quantum architectures

Vankov

Mills

Wallden

et al. 2019

Quantum Sci. Technol.

Self Cite

View full text Add to dashboard Cite

As research on building scalable quantum computers advances, it is important to be able to certify their correctness. Due to the exponential hardness of classically simulating quantum computation, straight-forward verification through classical simulation fails. However, we can classically simulate small scale quantum computations and hence we are able to test that devices behave as expected in this domain. This constitutes the first step towards obtaining confidence in the anticipated quantum-advantage when we extend to scales that can no longer be simulated.Realistic devices have restrictions due to their architecture and limitations due to physical imperfections and noise. Here we extend the usual ideal simulations by considering those effects. We provide a general methodology for constructing realistic simulations emulating the physical system which will both provide a benchmark for realistic devices, and guide experimental research in the quest for quantum-advantage.We exemplify our methodology by simulating a networked architecture and corresponding noise-model; in particular that of the device developed in the Networked Quantum Information Technologies Hub (NQIT) [1, 2]. For our simulations we use, with suitable modification, the classical simulator of [3]. The specific problems considered belong to the class of Instantaneous Quantum Polynomial-time (IQP) problems [4], a class believed to be hard for classical computing devices, and to be a promising candidate for the first demonstration of quantum-advantage. We first consider a subclass of IQP, defined in [5], involving two-dimensional dynamical quantum simulators, before moving to more general instances of IQP, but which are still restricted to the architecture of NQIT.

show abstract

Section: Exemplifying the Numerical Experiments Design Methodologymentioning

confidence: 99%

Section: Step 4: Clifford + T Simulator Of Bravyi and Gossetmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Methods for classically simulating noisy networked quantum architectures

Vankov

Mills

Wallden

et al. 2019

Quantum Sci. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…those with superconducting qubits, and in general, it also restricts the use of these quantum cloud services to users with suitable quantum technology. Motivated by this practical constrain, [CCKW18] introduced a protocol mimicking this remote state preparation resource over a purely classical channel (under the assumption that learning with error problem is computationally hard for quantum servers). This is a cryptographic primitive between a fully classical client and a server (with a quantum computer).…”

Section: Table Of Contents 1 Introductionmentioning

confidence: 99%

Security Limitations of Classical-Client Delegated Quantum Computing

Badertscher,

Cojocaru,

Colisson

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

Secure delegated quantum computing is a two-party cryptographic primitive, where a computationally weak client wishes to delegate an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. Communication via quantum channels is typically assumed such that the client can establish the necessary correlations with the server to securely perform the given task. This has the downside that all these protocols cannot be put to work for the average user unless a reliable quantum network is deployed. Therefore the question becomes relevant whether it is possible to rely solely on classical channels between client and server and yet benefit from its quantum capabilities while retaining privacy. Classical-client remote state preparation (RSP CC ) is one of the promising candidates to achieve this because it enables a client, using only classical communication resources, to remotely prepare a quantum state. However, the privacy loss incurred by employing RSP CC as sub-module to avoid quantum channels is unclear. In this work, we investigate this question using the Constructive Cryptography framework by Maurer and Renner [MR11]. We first identify the goal of RSP CC as the construction of ideal RSP resources from classical channels and then reveal the security limitations of using RSP CC in general and in specific contexts:1. We uncover a fundamental relationship between constructing ideal RSP resources (from classical channels) and the task of cloning quantum states with auxiliary information. Any classically constructed ideal RSP resource must leak to the server the full classical description (possibly in an encoded form) of the generated quantum state, even if we target computational security only. As a consequence, we find that the realization of common RSP resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem. 2. The above result does not rule out that a specific RSP CC protocol can replace the quantum channel at least in some contexts, such as the Universal Blind Quantum Computing (UBQC) protocol of Broadbent et al. [BFK09]. However, we show that the resulting UBQC protocol cannot maintain its proven composable security as soon as RSP CC is used as a subroutine. 3. We show that replacing the quantum channel of the above UBQC protocol by the RSP CC protocol QFactory of Cojocaru et al.[CCKW19], preserves the weaker, game-based, security of UBQC.

show abstract

On the possibility of classical client blind quantum computing

Cited by 2 publications

References 27 publications

Methods for classically simulating noisy networked quantum architectures

Methods for classically simulating noisy networked quantum architectures

Security Limitations of Classical-Client Delegated Quantum Computing

Contact Info

Product

Resources

About