scientific article
From MaRDI portal
Publication:3002816
DOI10.4086/toc.2010.v006a003zbMath1213.81052OpenAlexW85480495MaRDI 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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (14)
Complete Problem for Perfect Zero-Knowledge Quantum Proof ⋮ A Surprisingly Simple Way of Reversing Trace Distance via Entanglement ⋮ On the mixed-unitary rank of quantum channels ⋮ Connections between graphs and matrix spaces ⋮ An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs ⋮ Connectivity for quantum graphs ⋮ Random tensor theory: Extending random matrix theory to mixtures of random product states ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Quantum expanders and growth of group representations ⋮ 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\) ⋮ Correlation length in random MPS and PEPS ⋮ Spectral Analysis of Matrix Scaling and Operator Scaling
This page was built for publication:
