Unitary complexity in polynomial space
quant-ph, cs.CC, cs.CR
Submitted: 2026-10-02
Updated: 2026-10-05
Project page: https://sattath.github.io/microcrypt-zoo
Sources
- The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
- Non-Standard Oracles for Bounded-Error Complexity Classes
- Unitary Complexity and the Uhlmann Transformation Problem
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Creating superpositions that correspond to efficiently integrable probability distributions
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Topological obstructions to quantum computation with unitary oracles
- Quantum measurements and the Abelian Stabilizer Problem
- Commitments from Quantum One-Wayness
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians