scientific article
From MaRDI portal
Publication:3191572
DOI10.4086/toc.2013.v009a004zbMath1298.81046arXiv1011.3245OpenAlexW2611715903MaRDI QIDQ3191572
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.3245
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Physical optics (78A10) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (38)
Computing the permanent of (some) complex matrices ⋮ Efficient computation of permanents, with applications to boson sampling and random matrices ⋮ The Classification of Reversible Bit Operations ⋮ Near invariance of the hypercube ⋮ Algorithms for SU(n) boson realizations and D-functions ⋮ On immanant functions related to Weyl groups of A n ⋮ The complexity of approximating complex-valued Ising and Tutte partition functions ⋮ Microwave photonics with superconducting quantum circuits ⋮ \texttt{QOptCraft}: a python package for the design and study of linear optical quantum systems ⋮ Parameterizing density operators with arbitrary symmetries to gain advantage in quantum state estimation ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Unified quantum no-go theorems and transforming of quantum pure states in a restricted set ⋮ Spectral norm of a symmetric tensor and its computation ⋮ Approximate orthogonality of permutation operators, with application to quantum information ⋮ Quantum de Moivre–Laplace theorem for noninteracting indistinguishable particles in random networks ⋮ Many-particle interference in a two-component bosonic Josephson junction: an all-optical simulation ⋮ The Argument Against Quantum Computers ⋮ Roughness as classicality indicator of a quantum state ⋮ Establishing simple relationship between eigenvector and matrix elements ⋮ Unnamed Item ⋮ Exact and efficient simulation of concordant computation ⋮ Classically simulating quantum circuits with local depolarizing noise ⋮ A little bit of classical magic to achieve (super-)quantum speedup ⋮ Approximating permanents and hafnians ⋮ ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS ⋮ The equivalence of sampling and searching ⋮ How to Verify a Quantum Computation ⋮ Unnamed Item ⋮ Global estimates of errors in quantum computation by the Feynman-Vernon formalism ⋮ On the permanent of a random symmetric matrix ⋮ On the classical complexity of sampling from quantum interference of indistinguishable bosons ⋮ Simulating macroscopic quantum correlations in linear networks ⋮ Unnamed Item ⋮ Statistical benchmark for BosonSampling ⋮ Boson-sampling with non-interacting fermions ⋮ Performance of the quantum maxent estimation in the presence of physical symmetries ⋮ Cryptographic one-way function based on boson sampling ⋮ Unitary matrix decompositions for optimal and modular linear optics architectures
Cites Work
This page was built for publication:
