No label defined (Q5121907)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7250159

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7250159

Statements

scholarly article

0 references

0 references

0 references

publication date

22 September 2020

0 references

full work available at URL

https://arxiv.org/abs/1610.04670

0 references

zbMATH Keywords

permanent

0 references

linear optics

0 references

P-hardness

0 references

orthogonal matrices

0 references

MaRDI profile type

MaRDI publication profile

0 references

Quantum computing, postselection, and probabilistic polynomial-time

0 references

A linear-optical proof that the permanent is # <b>P</b> -hard

0 references

Quantum Computability

0 references

On computing the determinant in small parallel time using a small number of processors

0 references

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

0 references

On quantum field theory — I: explicit solution of Dyson’s equation in electrodynamics without use of feynman graphs

0 references

Gap-definable counting classes

0 references

Mathematical Foundations of Computer Science 2005

0 references

0 references

0 references

Cancellation is exponentially powerful for computing the determinant

0 references

0 references

PP is as Hard as the Polynomial-Time Hierarchy

0 references

Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy

0 references

0 references

The complexity of computing the permanent

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.CCC.2018.19

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5121907

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5121907&oldid=36618680"