Efficient Certifiable Randomness from a Single Quantum Device

Mahadev, Urmila; Vazirani, Umesh; Vidick, Thomas

doi:10.48550/arxiv.2204.11353

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quantum algorithms have been shown to solve a broad range of computational problems ranging from search to physical simulation [1][2][3][4][5][6][7][8]. Recent progress in the experimental realization of scalable quantum computers have further generated excitement about the potential of quantum algorithms in practice [9][10][11][12][13].…”

mentioning

confidence: 99%

Graphical quantum Clifford-encoder compilers from the ZX calculus

Khesin¹,

Lu²

2023

Preprint

View full text Add to dashboard Cite

We present a quantum compilation algorithm that maps Clifford encoders, an equivalence class of quantum circuits that arise universally in quantum error correction, into a representation in the ZX calculus. In particular, we develop a canonical form in the ZX calculus and prove canonicity as well as efficient reducibility of any Clifford encoder into the canonical form. The diagrams produced by our compiler explicitly visualize information propagation and entanglement structure of the encoder, revealing properties that may be obscured in the circuit or stabilizer-tableau representation.

show abstract

mentioning

confidence: 99%

Graphical quantum Clifford-encoder compilers from the ZX calculus

Khesin¹,

Lu²

2023

Preprint

View full text Add to dashboard Cite

show abstract

Post-quantum $$\kappa $$-to-1 trapdoor claw-free functions from extrapolated dihedral cosets

Yan,

Wang,

et al. 2024

Quantum Inf Process

View full text Add to dashboard Cite

Lattice-Based Quantum Advantage from Rotated Measurements

Alnawakhtha,

Mantri,

Miller

et al. 2024

Quantum

View full text Add to dashboard Cite

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 al. 2018, Kalai et al. 2022), we show an optimized two-round proof of quantumness whose security can be expressed directly in terms of the hardness of the LWE (learning with errors) problem. Second, we construct a one-round protocol for blind remote preparation of an arbitrary state on the XY-plane up to a Pauli-Z correction.

show abstract

Efficient Certifiable Randomness from a Single Quantum Device

Cited by 3 publications

References 5 publications

Graphical quantum Clifford-encoder compilers from the ZX calculus

Graphical quantum Clifford-encoder compilers from the ZX calculus

Post-quantum $$\kappa $$-to-1 trapdoor claw-free functions from extrapolated dihedral cosets

Lattice-Based Quantum Advantage from Rotated Measurements

Contact Info

Product

Resources

About