Lattice-Based Quantum Advantage from Rotated Measurements

  title={Lattice-Based Quantum Advantage from Rotated Measurements},
  author={Yusuf Alnawakhtha and A. N. Mantri and Carl A. Miller and Daochen Wang},
  journal={IACR Cryptol. ePrint Arch.},
. Trapdoor claw-free functions (TCFs) are immensely valuable in cryptographic interactions between a classical client and a quantum server. Typically, a protocol has the quantum server prepare a superposition of two-bit strings of a claw and then measure it using Pauli- X or Z measurements. In this paper, we demonstrate a new technique that uses the entire range of qubit measurements from the XY -plane. We show the advantage of this approach in two applications. First, building on (Brakerski et… 

Figures from this paper



QFactory: classically-instructed remote secret qubits preparation

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).

Computational self-testing of multi-qubit states and measurements

A simplified version of this protocol is the first that can efficiently certify an arbitrary number of qubits of a cloud quantum computer, on which the authors cannot enforce spatial separation, using only classical communication.

Classically-Verifiable Quantum Advantage from a Computational Bell Test

This work proposes and analyse an interactive protocol for demonstrating quantum computational advantage, which is efficiently classically verifiable and can be applied to other quantum cryptographic protocols.

Blind quantum computing with weak coherent pulses.

The concept of ϵ blindness for UBQC is introduced, in analogy to the concept ofπ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections.

Self-Testing of a Single Quantum Device Under Computational Assumptions

This work constructs a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements.

On the Possibility of Classical Client Blind Quantum Computing

This work provides an instantiation of a trapdoor (approximately) 2-regular family of functions whose security is based on the hardness of the Learning-With-Errors problem, including a first analysis of the set of usable parameters.

Computationally-Secure and Composable Remote State Preparation

  • A. GheorghiuThomas Vidick
  • Mathematics, Computer Science
    2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2019
The implementation of "random remote state preparation with verification", a functionality first defined in (Dunjko and Kashefi 2014), is expected to be useful for removing the need for quantum communication in such protocols while keeping functionality.

Computational self-testing for entangled magic states

It is shown that a magic state for the CCZ gate can be self-tested while that for the T gate cannot, which is applicable to a proof of quantumness, where it can classically verify whether a quantum device generates a quantum state having non-zero magic.

Universal Blind Quantum Computation

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.

Simpler Proofs of Quantumness

A two-message (challenge-response) proof of quantumness based on any trapdoor claw-free function is given, which allows the use of smaller security parameters and more diverse computational assumptions, significantly reducing the quantum computational effort required for a successful demonstration.