The following pages link to (Q3522513):
Displayed 11 items.
- A new connection between quantum circuits, graphs and the Ising partition function (Q1007123) (← links)
- On computation of Boolean involutive bases (Q1956959) (← links)
- Classical simulation of quantum circuits by half Gauss sums (Q2113488) (← links)
- Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880) (← links)
- (Q3385623) (← links)
- A Mathematica Package for Simulation of Quantum Computation (Q3644093) (← links)
- Classical Ising model test for quantum circuits (Q5131403) (← links)
- Quadratic Form Expansions for Unitaries (Q5503295) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
- Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths? (Q6156859) (← links)