3 ms·
Likely this is an application of the Quantum Fourier Transform, which is O(n^2) where the classical analogue would be O(2^n) for n qubits. It's important to no
by xmcqdpt2 3y ago
Likely this is an application of the Quantum Fourier Transform, which is O(n^2) where the classical analogue would be O(2^n) for n qubits.
It's important to note as a caveat that no currently existing quantum computers are anywhere near good enough to implement such a deep circuit.
- bawolff 3y agoIs there a reason to assume that beyond QFT being famous?
- xmcqdpt2 3y agoFourier methods are pretty common in PDEs and the QFT is the core ingredient of many quantum computing algos, such as the quantum phase estimation algorithm used to find eigenvectors (such as modes of wave equations) or the HHL algorithm used to solve linear systems of equations (for example linearized PDE). Let's check the literature though, https://www.nature.com/articles/s41534-020-00291-0 https://www.nature.com/articles/s41534-020-00291-0 So apparently there are also quantum lattice gas models used for this, I know very little about those, but all the other methods are QFT based.