scientific article; zbMATH DE number 7559454
From MaRDI portal
Publication:5089258
DOI10.4230/LIPICS.MFCS.2020.83MaRDI QIDQ5089258FDOQ5089258
Authors: Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani
Publication date: 18 July 2022
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Analysis of Boolean Functions
- The computational complexity of linear optics
- Fundamentals of Computation Theory
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Simulating quantum computers with probabilistic methods
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
- Title not available (Why is that?)
Cited In (1)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089258)