Local random quantum circuits are approximate polynomial-designs: numerical results
From MaRDI portal
Publication:2843765
DOI10.1088/1751-8113/46/30/305301zbMath1272.81040arXiv1212.2556OpenAlexW1983553583MaRDI QIDQ2843765
Marek Mozrzymas, Piotr Ćwikliński, Michał Studziński, Łukasz Pańkowski, Michał Horodecki
Publication date: 26 August 2013
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2556
Quantum computation (81P68) Mathematical problems of computer architecture (68M07) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Modern compressive tomography for quantum information science, Chaos and complexity by design, Efficient unitary designs with a system-size independent number of non-Clifford gates, Compatibility of Quantum Measurements and Inclusion Constants for the Matrix Jewel, Generating a statet-design by diagonal quantum circuits
