Scalable ROM-PRUs imply a positive resolution to the Aaronson-Kuperberg unitary synthesis problem, with any such algorithm requiring a classical oracle of input length (2-o(1))log d that rules out existing candidates.
How to Construct Random Unitaries
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 3
method 1
citation-polarity summary
fields
quant-ph 5verdicts
UNVERDICTED 5representative citing papers
CBNE enables estimation of nonlinear quantum properties such as higher-order expectations from a single randomized measurement setting under sufficient system dimension or ancillary qubits.
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
Lecture notes and accompanying library teach replica tensor network methods to compute circuit-averaged observables in random quantum circuits by mapping them to classical statistical mechanics models.
Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.
citing papers explorer
-
On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem
Scalable ROM-PRUs imply a positive resolution to the Aaronson-Kuperberg unitary synthesis problem, with any such algorithm requiring a classical oracle of input length (2-o(1))log d that rules out existing candidates.
-
Quantum Nonlinear Properties from a Single Measurement Setting
CBNE enables estimation of nonlinear quantum properties such as higher-order expectations from a single randomized measurement setting under sufficient system dimension or ancillary qubits.
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
-
Lecture Notes on Replica Tensor Networks for Random Quantum Circuits
Lecture notes and accompanying library teach replica tensor network methods to compute circuit-averaged observables in random quantum circuits by mapping them to classical statistical mechanics models.
-
Quantum Dynamics in Krylov Space: Methods and Applications
Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.