Cryptography from pseudorandom quantum states
Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable
quantum states that are computationally indistinguishable from Haar-random states. One …
quantum states that are computationally indistinguishable from Haar-random states. One …
Wasserstein complexity of quantum circuits
Given a unitary transformation, what is the size of the smallest quantum circuit that
implements it? This quantity, known as the quantum circuit complexity, is a fundamental …
implements it? This quantity, known as the quantum circuit complexity, is a fundamental …
A Meta-Complexity Characterization of Quantum Cryptography
BP Cavalar, E Goldin, M Gray, P Hall - arXiv preprint arXiv:2410.04984, 2024 - arxiv.org
We prove the first meta-complexity characterization of a quantum cryptographic primitive. We
show that one-way puzzles exist if and only if there is some quantum samplable distribution …
show that one-way puzzles exist if and only if there is some quantum samplable distribution …
Complexity Theory for Quantum Promise Problems
Quantum computing introduces many problems rooted in physics, asking to compute
information from input quantum states. Determining the complexity of these problems has …
information from input quantum states. Determining the complexity of these problems has …
A Cryptographic Perspective on the Verifiability of Quantum Advantage
In recent years, achieving verifiable quantum advantage on a NISQ device has emerged as
an important open problem in quantum information. The sampling-based quantum …
an important open problem in quantum information. The sampling-based quantum …
Methods for Improved Analysis and Implementation of Algorithms for Local Hamiltonians
ME Morales Soler - 2023 - opus.lib.uts.edu.au
One of the main applications of quantum computers is expected to be computing properties
of physical systems. Of particular interest is that of computing ground states and of …
of physical systems. Of particular interest is that of computing ground states and of …
Methods for Improved Analysis and Implementation of Algorithms for Local Hamiltonians
MES Morales - 2023 - search.proquest.com
One of the main applications of quantum computers is expected to be computing properties
of physical systems. Of particular interest is that of computing ground states and of …
of physical systems. Of particular interest is that of computing ground states and of …
[PDF][PDF] Cryptography from Pseudorandom Quantum States
H Yuen - iacr.org
Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable
quantum states that are computationally indistinguishable from Haar-random states. One …
quantum states that are computationally indistinguishable from Haar-random states. One …