2.5k citations
- Princeton UniversityUS6 papers
- University of ChicagoUS5 papers
- Paul Scherrer InstituteCH3 papers
- Space Research Organisation NetherlandsNL3 papers
- Astronomical Institute of the Slovak Academy of SciencesSK2 papers
- Barnard CollegeUS2 papers
- Brookhaven National LaboratoryUS2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Hungarian Academy of SciencesHU2 papers
- Institute of Space and Astronautical ScienceJP2 papers
- Kavli Institute for Particle Astrophysics and CosmologyUS2 papers
- King's College LondonGB2 papers
Showing 2003 · quant-phShow all
2 papers · 2 filters
quant-ph2003★ 20 cited
Compiling Quantum Circuits using the Palindrome Transform
Alfred V. Aho, Krysta M. Svore
The design and optimization of quantum circuits is central to quantum computation. This paper presents new algorithms for compiling arbitrary 2^n x 2^n unitary matrices into effici…
quant-ph2003
Average case quantum lower bounds for computing the boolean mean
A. Papageorgiou
We study the average case approximation of the Boolean mean by quantum algorithms. We prove general query lower bounds for classes of probability measures on the set of inputs. We…