Pages that link to "Item:Q5419103"
From MaRDI portal
The following pages link to The computational complexity of linear optics (Q5419103):
Displaying 20 items.
- Nonnegativity for hafnians of certain matrices (Q5887700) (← links)
- (Q5889073) (← links)
- An Exact and Practical Classical Strategy for 2D Graph State Sampling (Q6082009) (← links)
- Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture (Q6083456) (← links)
- Algorithmic foundations for the diffraction limit (Q6087020) (← links)
- Stochastic approach to evolution of a quantum system interacting with environment in squeezed number state (Q6089496) (← links)
- Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
- Direct dialling of Haar random unitary matrices (Q6100601) (← links)
- A permanent inequality for positive semidefinite matrices (Q6104048) (← links)
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates (Q6165434) (← links)
- Strong simulation of linear optical processes (Q6167678) (← links)
- Quantum counterfactuality with identical particles (Q6168237) (← links)
- Light-Matter Interaction in the ZXW Calculus (Q6200520) (← links)
- Random quantum circuits transform local noise into global white noise (Q6202916) (← links)
- Quantum computational complexity with photons and linear optics (Q6547618) (← links)
- Exact finite-size scaling for the random-matrix representation of bond percolation on square lattice (Q6561185) (← links)
- Entanglement in the full state vector of boson sampling (Q6595400) (← links)
- Quantifying non-stabilizerness via information scrambling (Q6600311) (← links)
- Riemannian optimization of photonic quantum circuits in phase and Fock space (Q6613159) (← links)
- Quantum advantage from one-way functions (Q6652974) (← links)
