The following pages link to (Q3191572):
Displaying 38 items.
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism (Q723390) (← links)
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Microwave photonics with superconducting quantum circuits (Q1687621) (← links)
- Unified quantum no-go theorems and transforming of quantum pure states in a restricted set (Q1698799) (← links)
- Roughness as classicality indicator of a quantum state (Q1709200) (← links)
- On the permanent of a random symmetric matrix (Q2064039) (← links)
- Simulating macroscopic quantum correlations in linear networks (Q2074522) (← links)
- Performance of the quantum maxent estimation in the presence of physical symmetries (Q2101217) (← links)
- Cryptographic one-way function based on boson sampling (Q2106039) (← links)
- Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
- Establishing simple relationship between eigenvector and matrix elements (Q2213226) (← links)
- Classically simulating quantum circuits with local depolarizing noise (Q2238211) (← links)
- A little bit of classical magic to achieve (super-)quantum speedup (Q2241434) (← links)
- The equivalence of sampling and searching (Q2254498) (← links)
- Near invariance of the hypercube (Q2630874) (← links)
- Parameterizing density operators with arbitrary symmetries to gain advantage in quantum state estimation (Q2683263) (← links)
- On immanant functions related to Weyl groups of <i>A</i> <i>n</i> (Q2934210) (← links)
- Algorithms for SU(<i>n</i>) boson realizations and D-functions (Q3457148) (← links)
- How to Verify a Quantum Computation (Q4568113) (← links)
- Quantum de Moivre–Laplace theorem for noninteracting indistinguishable particles in random networks (Q4602771) (← links)
- The Classification of Reversible Bit Operations (Q4638073) (← links)
- Approximating permanents and hafnians (Q4645007) (← links)
- On the classical complexity of sampling from quantum interference of indistinguishable bosons (Q4985083) (← links)
- (Q5020598) (← links)
- (Q5089258) (← links)
- Counting single-qubit Clifford equivalent graph states is #P-complete (Q5110740) (← links)
- Spectral norm of a symmetric tensor and its computation (Q5113665) (← links)
- The Argument Against Quantum Computers (Q5119671) (← links)
- (Q5140846) (← links)
- Exact and efficient simulation of concordant computation (Q5144311) (← links)
- Boson-sampling with non-interacting fermions (Q5258464) (← links)
- ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS (Q5413313) (← links)
- Statistical benchmark for BosonSampling (Q5854979) (← links)
- Unitary matrix decompositions for optimal and modular linear optics architectures (Q5876384) (← links)
- \texttt{QOptCraft}: a python package for the design and study of linear optical quantum systems (Q6097316) (← links)
- Approximate orthogonality of permutation operators, with application to quantum information (Q6187142) (← links)
- Many-particle interference in a two-component bosonic Josephson junction: an all-optical simulation (Q6204518) (← links)
