scientific article

DOI10.4230/LIPIcs.STACS.2018.57zbMath1487.81052arXiv1608.07020MaRDI QIDQ3304156

Seiichiro Tani, Yasuhiro Takahashi

Publication date: 5 August 2020

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

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

zbMATH Keywords

quantum circuit complexityshallow quantum circuituninitialized qubit

Mathematics Subject Classification ID

Quantum computation (81P68) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Collapse of the hierarchy of constant-depth exact quantum circuits
• Boolean function complexity. Advances and frontiers.
• On the complexity of simulating space-bounded quantum computations
• A lower bound method for quantum circuits
• Parallel Quantum Computation and Quantum Codes
• Quantum Circuits with Unbounded Fan-out
• Quantum algorithms for classical lattice models
• Computing with a full memory
• Fundamentals of Computation Theory

This page was built for publication: