Cover Image

Unitary Complexity and the Uhlmann Transformation Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bostanci, John, Efron, Yuval, Metger, Tony, Poremba, Alexander, Qian, Luowen, Yuen, Henry
Format:	Preprint
Published:	2023
Subjects:	Quantum Physics Computational Complexity Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An efficient quantum parallel repetition theorem and applications
by: Bostanci, John, et al.
Published: (2023)

Pseudorandom unitaries with non-adaptive security
by: Metger, Tony, et al.
Published: (2024)

Simple constructions of linear-depth t-designs and pseudorandom unitaries
by: Metger, Tony, et al.
Published: (2024)

Quantum-Computable One-Way Functions without One-Way Functions
by: Kretschmer, William, et al.
Published: (2024)

Quantum Cryptography in Algorithmica
by: Kretschmer, William, et al.
Published: (2022)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
by: Ananth, Prabhanjan, et al.
Published: (2024)

Average-Case Complexity of Quantum Stabilizer Decoding
by: Khesin, Andrey Boris, et al.
Published: (2025)

On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem
by: Brakerski, Zvika, et al.
Published: (2026)

Efficient Quantum Pseudorandomness from Hamiltonian Phase States
by: Bostanci, John, et al.
Published: (2024)

Quantum Pseudorandomness and Classical Complexity
by: Kretschmer, William
Published: (2021)

A Meta-Complexity Characterization of Quantum Cryptography
by: Cavalar, Bruno P., et al.
Published: (2024)

NISQ Security and Complexity via Simple Classical Reasoning
by: Cojocaru, Alexandru, et al.
Published: (2025)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)

Unconditionally secure quantum commitments with preprocessing
by: Qian, Luowen
Published: (2023)

Quartic quantum speedups for planted inference
by: Schmidhuber, Alexander, et al.
Published: (2024)

Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries
by: Ananth, Prabhanjan, et al.
Published: (2025)

Succinct arguments for QMA from standard assumptions via compiled nonlocal games
by: Metger, Tony, et al.
Published: (2024)

Impersonating Quantum Secrets over Classical Channels
by: Qian, Luowen, et al.
Published: (2026)

Pseudorandom Unitaries in the Haar Random Oracle Model
by: Ananth, Prabhanjan, et al.
Published: (2025)

Finding dense sub-lattices as low-energy states of a Hamiltonian
by: Barberà-Rodríguez, Júlia, et al.
Published: (2023)

A Note on Output Length of One-Way State Generators and EFIs
by: Hhan, Minki, et al.
Published: (2023)

On the Computational Hardness of Quantum One-Wayness
by: Cavalar, Bruno, et al.
Published: (2023)

Quantum delegation with an off-the-shelf device
by: Broadbent, Anne, et al.
Published: (2023)

Quantum Advantage from One-Way Functions
by: Morimae, Tomoyuki, et al.
Published: (2023)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
by: Li, Xingjian, et al.
Published: (2023)

A Computational Separation Between Quantum No-cloning and No-telegraphing
by: Nehoran, Barak, et al.
Published: (2023)

Quantum Pseudorandom Scramblers
by: Lu, Chuhan, et al.
Published: (2023)

Pseudorandom unitaries are neither real nor sparse nor noise-robust
by: Haug, Tobias, et al.
Published: (2023)

Pseudorandom and Pseudoentangled States from Subset States
by: Jeronimo, Fernando Granha, et al.
Published: (2023)

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
by: Kitagawa, Fuyuki, et al.
Published: (2023)

Pseudorandom density matrices
by: Bansal, Nikhil, et al.
Published: (2024)

Clifford Strategies in Interactive Protocols are Classically Simulatable
by: Shalit, Itay
Published: (2024)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
by: Morimae, Tomoyuki, et al.
Published: (2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography
by: Hiroka, Taiga, et al.
Published: (2025)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
by: Arteche, Noel, et al.
Published: (2024)

Experimental relativistic zero-knowledge proofs with unconditional security
by: Weng, Chen-Xun, et al.
Published: (2025)

Verifiable Quantum Advantage without Structure
by: Yamakawa, Takashi, et al.
Published: (2022)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
by: Morimae, Tomoyuki, et al.
Published: (2025)

Parallel Kac's Walk Generates PRU
by: Lu, Chuhan, et al.
Published: (2025)

Improved Quantum Lifting by Coherent Measure-and-Reprogram
by: Cojocaru, Alexandru, et al.
Published: (2025)