Publication:3002816
From MaRDI portal
DOI10.4086/toc.2010.v006a003zbMath1213.81052MaRDI QIDQ3002816
Amnon Ta-Shma, Avraham Ben-Aroya, Oded Schwartz
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2010.v006a003
81P68: Quantum computation
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items
Generalized Quantum Arthur--Merlin Games, Spectral Analysis of Matrix Scaling and Operator Scaling, Connections between graphs and matrix spaces, Random tensor theory: Extending random matrix theory to mixtures of random product states, Quantum expanders and growth of group representations, Correlation length in random MPS and PEPS, On the mixed-unitary rank of quantum channels, Connectivity for quantum graphs, Quantum expanders and geometry of operator spaces, Exponential decay of correlations implies area law, Counterexamples to the maximal \(p\)-norm multiplicativity conjecture for all \(p>1\), An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs, Complete Problem for Perfect Zero-Knowledge Quantum Proof, A Surprisingly Simple Way of Reversing Trace Distance via Entanglement
