This compendium presents a structured collection of computational problems with credible prospects for realizing meaningful quantum advantage, focused on describing problem characteristics rather than specific algorithms. It is intended for non-quantum researchers and practitioners with strong computational backgrounds...
Philipp Kammerlander, T. O'Brien, R. King et al.· 0 citations
Two new approaches to QFT circuit construction are developed, based on Mackey theory and Clifford theory, respectively, and used to show exponential improvement in circuit cost for specific group families.
Carli Bruinsma, P. M. Posta, Joppe Stokvis et al.· 0 citations
The collective tomography protocols for quantum states and channels with known symmetries are given, using random purification and dilation to reduce learning to pure-state estimation and resolve an open problem in quantum tomography of constructing efficient quantum circuits.
Satoshi Yoshida, K. Okigami, P. M. Posta et al.· 0 citations
Quantum Fourier transforms (QFTs) are essential primitives in quantum algorithms. While abelian groups admit efficient QFT circuits, with circuit size polynomial in the logarithm of the group order, efficient constructions are known for relatively few non-abelian families. We develop two new approaches to QFT circuit c...
Carli Bruinsma, P. M. Posta, Joppe Stokvis et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
