scientific article; zbMATH DE number 7250159
From MaRDI portal
Publication:5121907
DOI10.4230/LIPIcs.CCC.2018.19zbMath1441.68073arXiv1610.04670MaRDI QIDQ5121907
Publication date: 22 September 2020
Full work available at URL: https://arxiv.org/abs/1610.04670
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Determinants, permanents, traces, other special matrix functions (15A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (max. 100)
Maximizing products of linear forms, and the permanent of positive semidefinite matrices ⋮ Inapproximability of positive semidefinite permanents and quantum state tomography ⋮ Strong simulation of linear optical processes ⋮ A remark on approximating permanents of positive definite matrices ⋮ A Tight Analysis of Bethe Approximation for Permanent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cancellation is exponentially powerful for computing the determinant
- The complexity of computing the permanent
- On computing the determinant in small parallel time using a small number of processors
- Gap-definable counting classes
- A linear-optical proof that the permanent is # P -hard
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- PP is as Hard as the Polynomial-Time Hierarchy
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- Quantum Computability
- Quantum computing, postselection, and probabilistic polynomial-time
- Mathematical Foundations of Computer Science 2005
- On quantum field theory — I: explicit solution of Dyson’s equation in electrodynamics without use of feynman graphs
This page was built for publication:
