scientific article; zbMATH DE number 7564421

DOI10.4230/LIPIcs.CCC.2019.21MaRDI QIDQ5091772

François Le Gall

Publication date: 27 July 2022

Full work available at URL: https://arxiv.org/abs/1810.12792

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum computingcircuit complexityconstant-depth circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Unnamed Item ⋮ Power of uninitialized qubits in shallow quantum circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Collapse of the hierarchy of constant-depth exact quantum circuits
• Trading locality for time: certifiable randomness from low-depth circuits
• Quantum Circuits with Unbounded Fan-out
• Quantum Computation and Quantum Information
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Multiparty entanglement in graph states
• Quantum Complexity Theory
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY
• Oracle separation of BQP and PH
• Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
• Quantum advantage with shallow circuits
• The computational complexity of linear optics

This page was built for publication: