Pages that link to "Item:Q126355"
From MaRDI portal
The following pages link to The Classical Complexity of Boson Sampling (Q126355):
Displaying 20 items.
- BosonSampling (Q126356) (← links)
- Multi-boson correlation sampling (Q291571) (← links)
- Graph isomorphism and Gaussian boson sampling (Q825567) (← links)
- Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles (Q2100803) (← links)
- A quantum hash function with grouped coarse-grained boson sampling (Q2102295) (← 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)
- Partial distinguishability as a coherence resource in boson sampling (Q2677582) (← links)
- Classical benchmarking of Gaussian boson sampling on the Titan supercomputer (Q2681599) (← links)
- Models in quantum computing: a systematic review (Q2687125) (← links)
- The computational complexity of linear optics (Q3191572) (← links)
- (Q4607883) (redirect page) (← links)
- On the classical complexity of sampling from quantum interference of indistinguishable bosons (Q4985083) (← links)
- Majorization and the time complexity of linear optical networks (Q5056236) (← links)
- On the classical hardness of spoofing linear cross-entropy benchmarking (Q5140846) (← links)
- Sampling of bosonic qubits (Q5247049) (← links)
- The computational complexity of linear optics (Q5419103) (← links)
- Unitary matrix decompositions for optimal and modular linear optics architectures (Q5876384) (← links)
- Implementation of photon partial distinguishability in a quantum optical circuit simulation (Q6162908) (← links)
- Strong simulation of linear optical processes (Q6167678) (← links)