Testing classical properties from quantum data
From MaRDI portal
Cites work
- (Pseudo) random quantum states with binary phase
- A characterization of constant-sample testable properties
- A lower bound for testing juntas
- A new proof of the graph removal lemma
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
- Algorithmic and analysis techniques in property testing
- An arithmetic analogue of Fox's triangle removal argument
- Efficient quantum algorithms for (gapped) group testing and junta testing
- Efficient unitary designs from random sums and permutations
- Every locally characterized affine-invariant property is testable
- Exponential separations between learning with and without quantum memory
- Forrelation: a problem that optimally separates quantum from classical computing
- Four decades of research on bent functions
- Higher-order Fourier analysis and applications
- How much are increasing sets positively correlated?
- scientific article; zbMATH DE number 6538684 (Why is no real title available?)
- scientific article; zbMATH DE number 2156274 (Why is no real title available?)
- scientific article; zbMATH DE number 5057523 (Why is no real title available?)
- Improved Quantum data analysis
- Introduction to Property Testing
- Invariance in property testing
- Lower bounds for testing complete positivity and quantum separability
- Nearly optimal bounds for sample-based testing and learning of k-monotone functions
- New results on quantum property testing
- On active and passive testing
- On learning monotone Boolean functions
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems
- On sample-based testers
- On the Power of Quantum Computation
- Optimal algorithms for learning quantum phase states
- Optimal testing of Reed-Muller codes
- Optimal tradeoffs for estimating Pauli observables
- Partially symmetric functions are efficiently isomorphism testable
- Probabilistic checking of proofs
- Probing quantum state space: does one have to learn everything to learn something?
- Proof verification and the hardness of approximation problems
- Property testing and its connection to learning and approximation
- Pseudorandom quantum states
- Quantum advantage in learning from experiments
- Quantum algorithms for learning and testing juntas
- Quantum Complexity Theory
- Quantum learning algorithms for quantum measurements
- Quantum Property Testing
- Quantum spectrum testing
- Random unitaries in extremely low depth
- Robust Characterizations of Polynomials with Applications to Program Testing
- Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations
- Sequential measurements, disturbance and property testing
- Shadow tomography of quantum states
- Simple constructions of linear-depth t-designs and pseudorandom unitaries
- Testing and learning quantum juntas nearly optimally
- Testing juntas nearly optimally
- Testing matrix product states
- Testing monotonicity
- Testing product states, quantum Merlin-Arthur games and tensor optimization
- The PCP theorem by gap amplification
- Tolerant property testing and distance approximation
- Trading query complexity for sample-based testing and multi-testing scalability
- Unitary property testing lower bounds by polynomials
This page was built for publication: Testing classical properties from quantum data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445550)