# Computationally-Secure and Composable Remote State Preparation

@article{Gheorghiu2019ComputationallySecureAC, title={Computationally-Secure and Composable Remote State Preparation}, author={Alexandru Gheorghiu and Thomas Vidick}, journal={2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)}, year={2019}, pages={1024-1033} }

We introduce a protocol between a classical polynomial-time verifier and a quantum polynomial-time prover that allows the verifier to securely delegate to the prover the preparation of certain single-qubit quantum states The prover is unaware of which state he received and moreover, the verifier can check with high confidence whether the preparation was successful. The delegated preparation of single-qubit states is an elementary building block in many quantum cryptographic protocols. We expect…

## 37 Citations

On the Possibility of Classical Client Blind Quantum Computing

- Computer Science, PhysicsCryptogr.
- 2021

Using the functionality of delegated pseudo-secret random qubit generator (PSRQG), a classical client can instruct the preparation of a sequence of random qubits at some distant party, one could achieve a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation).

Secure Quantum Computation with Classical Communication

- Computer ScienceIACR Cryptol. ePrint Arch.
- 2021

A constant-round composable protocol for blind and verifiable classical delegation of quantum computation is constructed, and applications to secure quantum computation with classical communication are shown.

QFactory: classically-instructed remote secret qubits preparation

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2019

This contribution defines a simpler (basic) primitive consisting of only BB84 states, and gives a protocol that realizes this primitive and that is secure against the strongest possible adversary (an arbitrarily deviating malicious server).

Trusted center verification model and classical channel remote state preparation

- Computer Science, Physics
- 2020

It is shown that the first quantum message transmission cannot be replaced with an (even approximate) ccRSP protocol while keeping the information-theoretical soundness unless BQP is contained in AM, which solves the long-standing open problem.

Quantum Shell Games: How to Classically Delegate the Preparation of Authenticated Quantum States

- 2019

We propose novel protocols for verifiable, classically instructed remote state preparation. Our “Shell Game” protocols require constantly many rounds of communication to prepare an arbitrary number…

Implementing Remote-State Preparation on a Noisy-Intermediate Size Quantum Device

- 2020

In this research project, we investigate the implementation of a protocol for remotely preparing quantum states, with applications to blind and verifiable delegated quantum computation. The…

QEnclave - A practical solution for secure quantum cloud computing

- Computer Science, PhysicsArXiv
- 2021

This work introduces a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls, and shows that this same functionality can be achieved with a client that only transforms quantum states without generating or measuring them.

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

- Physics, Computer ScienceIACR Cryptol. ePrint Arch.
- 2019

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.

Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center

- Computer Science, PhysicsArXiv
- 2020

This paper constructs an information-theoretically-sound non-interactive classical verification protocol for quantum computing with a trusted center, and builds a non-Interactive statistical zero-knowledge proof system for QMA with the trusted center.

Depth-efficient proofs of quantumness

- Physics
- 2021

A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can…

## References

SHOWING 1-10 OF 45 REFERENCES

Delegated Pseudo-Secret Random Qubit Generator

- Computer ScienceArXiv
- 2018

Using the functionality of delegated pseudo-secret random qubit generator (PSRQG), one could achieve for the first time a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation).

Robustness and device independence of verifiable blind quantum computing

- Physics, Computer Science
- 2015

The robustness of the single server verifiable universal blind quantum computing protocol of Fitzsimons and Kashefi is proved in the most general scenario and the composition of this protocol with a device-independent state tomography protocol that is based on the rigidity of CHSH games as proposed by Reichardt et al.

Unconditionally verifiable blind quantum computation

- Physics
- 2017

Blind quantum computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output, and computation remain private. A desirable property for…

How to Verify a Quantum Computation

- Mathematics, PhysicsTheory Comput.
- 2018

This work gives a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity, using a reduction to an entanglement-based protocol and showing that verification could be achieved at minimal cost compared to performing the computation.

Post hoc verification of quantum computation

- Mathematics, MedicinePhysical review letters
- 2018

It is demonstrated that the verification can be achieved independently from the blindness, and it is shown that a constant round protocol with a single prover and a completely classical verifier is not possible, unless bounded error quantum polynomial time (BQP) is contained in the third level of thePolynomial hierarchy.

Blind quantum computing with two almost identical states

- Physics, Computer ScienceArXiv
- 2016

This work identifies sufficient criteria on the powers of the client, which still allow for secure blind quantum computation, in a universally composable framework, and provides a series of protocols, where each step reduces the number of differing states the client needs to be able to prepare.

Universal Blind Quantum Computation

- Computer Science, Mathematics2009 50th Annual IEEE Symposium on Foundations of Computer Science
- 2009

The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side.

A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

- Physics, Computer Science2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
- 2018

The randomness protocol can be used as the basis for an efficiently verifiable "quantum supremacy" proposal, thus answering an outstanding challenge in the field.

Composability in quantum cryptography

- Physics, Computer ScienceArXiv
- 2010

This article explains the universal composability (UC) framework and state the composition theorem that guarantees that secure protocols can securely be composed to larger applications and shows how to generate a continuous key stream by sequentially composing rounds of a QKD protocol.

Optimised resource construction for verifiable quantum computation

- Computer Science, Mathematics
- 2015

A new construction that simplifies the required resources for any such verifiable protocol, and is generic and could be applied to any universal or non-universal scheme with a given underlying graph.