Publication:3522513
From MaRDI portal
zbMath1213.81067arXivquant-ph/0408129MaRDI QIDQ3522513
No author found.
Publication date: 3 September 2008
Full work available at URL: https://arxiv.org/abs/quant-ph/0408129
81P68: Quantum computation
Related Items
Classical Ising model test for quantum circuits, Quadratic Form Expansions for Unitaries, Complexity limitations on one-turn quantum refereed games, Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?, A new connection between quantum circuits, graphs and the Ising partition function, On computation of Boolean involutive bases, Classical simulation of quantum circuits by half Gauss sums, Efficient computation of permanents, with applications to boson sampling and random matrices, Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$, Unnamed Item, A Mathematica Package for Simulation of Quantum Computation