$\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing
The Quantum Fourier Transform (QFT) is employed by hidden subgroup problem (HSP) algorithms, including Shor's algorithm for factoring. The circuit depth of the QFT remains challenging for near-term hardware. To find shallower alternatives we identify two properties that are exploited by the QFT to enable HSP. Firstly, the shift invariance of the QFT allows for the removal of a random overall shift. Secondly, the QFT retains information about the hidden subgroup generator accessible in the measurement outcomes. We quantify that information via the discrete Fisher information. We construct a family of shallow circuits using Hadamards and controlled-Phase gates, HP-$L$ circuits, that we prove preserve shift invariance. Numerical analysis shows these circuits retain exponentially growing Fisher information. The $\mathcal{O}(n)$ HP-$1$ is employed in place of the $\mathcal{O}(n^2)$ QFT in our numerical implementation of Shor's algorithm. An efficient neural network is used for the corresponding classical post-processing.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Universal Approximation Theorem and error bounds for quantum neural networks and quantum reservoirs
Universal approximation theorems are the foundations of classical neural networks, providing theoretical guarantees that the latter are able to approximate maps of interest. Recent results have shown that this can also b…
Two new results about quantum exact learning
We present two new results about exact learning by quantum computers. First, we show how to exactly learn a $k$-Fourier-sparse $n$-bit Boolean function from $O(k^{1.5}(\log k)^2)$ uniform quantum examples for that functi…
LEMMAVocal Bursts Valence PredictionQuantum Neural Physics: Solving Partial Differential Equations on Quantum Simulators using Quantum Convolutional Neural Networks
Neural Physics recasts local discretisations of partial differential equations (PDEs) as fixed convolutional operators, providing a physics-preserving alternative to data-driven surrogate modelling in scientific machine …
Image Processing in Quantum Computers
Quantum Image Processing (QIP)is an exciting new field showing a lot of promise as a powerful addition to the arsenal of Image Processing techniques. Representing image pixel by pixel using classical information requires…
Information-theoretic bounds on quantum advantage in machine learning
We study the performance of classical and quantum machine learning (ML) models in predicting outcomes of physical experiments. The experiments depend on an input parameter $x$ and involve execution of a (possibly unknown…
BIG-bench Machine LearningQuantum Machine Learning