Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions

• URL: http://arxiv.org/abs/2302.03888v2
• Date: Sat, 21 Oct 2023 19:45:58 GMT
• Title: Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
• Authors: Mudassir Moosa, Thomas W. Watts, Yiyou Chen, Abhijat Sarma, Peter L. McMahon
• Abstract summary: The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms. We present a method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. We show that the method can efficiently load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than $10-6$ and $10-3$, respectively.
• Score: 1.3593246617391264
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms. We introduce the Fourier Series Loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. The FSL method prepares a ($Dn$)-qubit state encoding the $2^{Dn}$-point uniform discretization of a $D$-dimensional function specified by a $D$-dimensional Fourier series. A free parameter $m < n$ determines the number of Fourier coefficients, $2^{D(m+1)}$, used to represent the function. The FSL method uses a quantum circuit of depth at most $2(n-2)+\lceil \log_{2}(n-m) \rceil + 2^{D(m+1)+2} -2D(m+1)$, which is linear in the number of Fourier coefficients, and linear in the number of qubits ($Dn$) despite the fact that the loaded function's discretization is over exponentially many ($2^{Dn}$) points. We present a classical compilation algorithm with runtime $O(2^{3D(m+1)})$ to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than $10^{-6}$ and $10^{-3}$, respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H$1$-$1$ and H$1$-$2$ trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over $95\%$, as well as various 1D real-valued functions on up to 6 qubits with classical fidelities $\approx 99\%$, and a 2D function on 10 qubits with a classical fidelity $\approx 94\%$.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Fast Fourier transforms and fast Wigner and Weyl functions in large quantum systems [0.0]
  Two methods for fast Fourier transforms are used in a quantum context. The first method is for systems with dimension of the Hilbert space $D=dn$ with $d$ an odd integer. The second method is also used for the fast calculation of Wigner and Weyl functions, in quantum systems with large finite dimension of the Hilbert space.
  arXiv  Detail & Related papers  (2024-05-08T15:54:35Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Beyond Heisenberg Limit Quantum Metrology through Quantum Signal Processing [0.0]
  We propose a quantum-signal-processing framework to overcome noise-induced limitations in quantum metrology. Our algorithm achieves an accuracy of $10-4$ radians in standard deviation for learning $theta$ in superconductingqubit experiments. Our work is the first quantum-signal-processing algorithm that demonstrates practical application in laboratory quantum computers.
  arXiv  Detail & Related papers  (2022-09-22T17:47:21Z)
• Extracting a function encoded in amplitudes of a quantum state by tensor network and orthogonal function expansion [0.0]
  We present a quantum circuit and its optimization procedure to obtain an approximating function of $f$ that has a number of degrees of freedom with respect to $d$. We also conducted a numerical experiment to approximate a finance-motivated function to demonstrate that our method works.
  arXiv  Detail & Related papers  (2022-08-31T04:10:24Z)
• Calculation of generating function in many-body systems with quantum computers: technical challenges and use in hybrid quantum-classical methods [0.0]
  The generating function of a Hamiltonian $H$ is defined as $F(t)=langle e-itHrangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. We show how the information content of this function can be used a posteriori on classical computers to solve quantum many-body problems.
  arXiv  Detail & Related papers  (2021-04-16T15:44:27Z)
• Quantum Simulation of Molecules without Fermionic Encoding of the Wave Function [62.997667081978825]
  fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. An application to computing the ground-state energy and 2-RDM of H$_4$ is presented.
  arXiv  Detail & Related papers  (2021-01-27T18:57:11Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)
• Quantum Legendre-Fenchel Transform [6.643082745560234]
  We present a quantum algorithm to compute the discrete Legendre-Fenchel transform. We show that our quantum algorithm is optimal up to polylogarithmic factors.
  arXiv  Detail & Related papers  (2020-06-08T18:00:05Z)
• Minimum optical depth multi-port interferometers for approximating any unitary transformation and any pure state [52.77024349608834]
  We show that any pure state, in any dimension $d$, can be prepared with infidelity $le 10-15$ using multi-port interferometers. The schemes in [Phys. Rev. Lett. textbf73, 58 (1994) and Optica text3, 1460, 1460, only achieves an infidelity in the order of $10-7$ for block-diagonal unitary transformations.
  arXiv  Detail & Related papers  (2020-02-04T15:40:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.