An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs
From MaRDI portal
Publication:2685613
DOI10.1007/s11128-021-03238-2OpenAlexW3201561653WikidataQ124988516 ScholiaQ124988516MaRDI QIDQ2685613
Publication date: 22 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03238-2
Quantum computation (81P68) Embeddings of discrete metric spaces into Banach spaces; applications in topology and computer science (46B85)
Cites Work
- Unnamed Item
- Unnamed Item
- Local random quantum circuits are approximate polynomial-designs
- Private vs. common random bits in communication complexity
- Dimensionality reduction of SDPs through sketching
- Storing information with extractors.
- Limitations on Quantum Dimensionality Reduction
- Are Bitvectors Optimal?
- Extensions of Lipschitz mappings into a Hilbert space
- A property of quantum relative entropy with an application to privacy in quantum communication
- Large deviation bounds for k -designs
- Randomness conductors and constant-degree lossless expanders
- An Introduction to Random Matrices
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
This page was built for publication: An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs
