Pages that link to "Item:Q5419103"
From MaRDI portal
The following pages link to The computational complexity of linear optics (Q5419103):
Displayed 50 items.
- Multi-boson correlation sampling (Q291571) (← links)
- Graph isomorphism and Gaussian boson sampling (Q825567) (← links)
- Characterizing limits and opportunities in speeding up Markov chain mixing (Q2029783) (← links)
- Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles (Q2100803) (← links)
- Theory of quantum games and quantum economic behavior (Q2102221) (← links)
- A quantum hash function with grouped coarse-grained boson sampling (Q2102295) (← links)
- Learning nonlinear input-output maps with dissipative quantum systems (Q2105978) (← links)
- Applications of the Lambert-Tsallis \(W_q\) function in quantum photonic Gaussian boson sampling (Q2108015) (← links)
- Simultaneous sorting many qudits using different input ports (Q2110967) (← links)
- Constant-round blind classical verification of quantum sampling (Q2170108) (← links)
- Sum rules in multiphoton coincidence rates (Q2213169) (← links)
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average (Q2240857) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- Partial distinguishability as a coherence resource in boson sampling (Q2677582) (← links)
- Classical benchmarking of Gaussian boson sampling on the Titan supercomputer (Q2681599) (← links)
- Optimal approximation to unitary quantum operators with linear optics (Q2685615) (← links)
- Models in quantum computing: a systematic review (Q2687125) (← links)
- Quantum classifiers for domain adaptation (Q2693860) (← links)
- Optimised resource construction for verifiable quantum computation (Q2988006) (← links)
- The Equivalence of Sampling and Searching (Q3007612) (← links)
- Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable (Q3196386) (← links)
- (Q3384939) (← links)
- Which role does multiphoton interference play in small phase estimation in quantum Fourier transform interferometers? (Q4584388) (← links)
- <i>SU</i>(<i>p</i>,<i>q</i>) coherent states and a Gaussian de Finetti theorem (Q4639372) (← links)
- A Tight Analysis of Bethe Approximation for Permanent (Q5020728) (← links)
- Arbitrated quantum signature protocol with boson sampling-based random unitary encryption (Q5061300) (← links)
- Two-boson quantum interference in time (Q5073241) (← links)
- Anticoncentration and the Exact Gap-Hamming Problem (Q5074948) (← links)
- (Q5091154) (← links)
- (Q5091772) (← links)
- (Q5121909) (← links)
- Universal quantum computation by scattering in the Fermi–Hubbard model (Q5136105) (← links)
- Robustness and device independence of verifiable blind quantum computing (Q5151595) (← links)
- Concentration and Moment Inequalities for Polynomials of Independent Random Variables (Q5743410) (← links)
- Generalised phase kick-back: the structure of computational algorithms from physical principles (Q5854990) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Time independent universal computing with spin chains: quantum plinko machine (Q5855076) (← links)
- Towards quantum supremacy with lossy scattershot boson sampling (Q5855115) (← links)
- A quantum interior-point predictor–corrector algorithm for linear programming (Q5871119) (← links)
- Immanants of blocks from random matrices in some unitary ensembles (Q5874048) (← links)
- Nonnegativity for hafnians of certain matrices (Q5887700) (← links)
- (Q5889073) (← links)
- Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture (Q6083456) (← 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)
- (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)