Quantum data sketches
From MaRDI portal
Cites work
- Efficient quantum tomography
- Fast and robust quantum state tomography from few basis measurements
- How Many Copies are Needed for State Discrimination?
- scientific article; zbMATH DE number 3615775 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 7701523 (Why is no real title available?)
- Improved Quantum data analysis
- Locality-sensitive hashing scheme based on p-stable distributions
- Near Linear Lower Bound for Dimension Reduction in L1
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computation and quantum information. 10th anniversary edition
- Quantum systems, channels, information. A mathematical introduction.
- Sample-optimal tomography of quantum states
- Sample-optimal tomography of quantum states
- Sequential measurements, disturbance and property testing
- Shadow tomography of quantum states
- Testing and learning quantum juntas nearly optimally
- The Complexity of the Local Hamiltonian Problem
- The learnability of quantum states
- The quest for a quantum neural network
This page was built for publication: Quantum data sketches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292783)