Efficient explicit circuit for quantum state preparation of piece-wise continuous functions

• URL: http://arxiv.org/abs/2411.01131v2
• Date: Tue, 22 Apr 2025 09:39:16 GMT
• Title: Efficient explicit circuit for quantum state preparation of piece-wise continuous functions
• Authors: Nikita Guseynov, Nana Liu,
• Abstract summary: We propose a method to upload a function $f(x)$ on the interval $x in (a, b)$ into a pure quantum state consisting of qubits.<n>The preparation cost has $mathcalO(nlog n)$ scaling in the number of qubits.<n>We introduce an explicit algorithm for uploading such functions using four reals that meet specific parity and boundedness conditions.
• Score: 0.6906005491572401
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by proposing a method to upload a polynomial function $f(x)$ on the interval $x \in (a, b)$ into a pure quantum state consisting of qubits, where a discretized $f(x)$ is the amplitude of this state. The preparation cost has $\mathcal{O}(n\log n)$ scaling in the number of qubits $n$ and linear scaling with the degree of the polynomial $Q$. This efficiency allows the preparation of states whose amplitudes correspond to high-degree polynomials, enabling the approximation of almost any continuous function. We introduce an explicit algorithm for uploading such functions using four real polynomials that meet specific parity and boundedness conditions. We also generalize this approach to piece-wise polynomial functions, with the algorithm scaling linearly with the number of piecewise parts. Our method achieves efficient quantum circuit implementation and we present detailed gate counting and resource analysis.

Related papers

• Entanglement-Assisted Coding for Arbitrary Linear Computations Over a Quantum MAC [34.32444379837011]
  We study a linear computation problem over a quantum multiple access channel (LC-QMAC) We propose an achievable scheme for LC-QMAC based on the stabilizer formalism and the ideas from entanglement-assisted quantum error-correcting codes (EAQECC)
  arXiv  Detail & Related papers  (2025-01-27T18:35:33Z)
• Nonlinear functions of quantum states [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits. We develop quantum algorithms of fundamental tasks, achieving a sample complexity of $tildemathcalO (1/(varepsilon2kappa)$ for both von Neumann entropy estimation and quantum state fidelity calculations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model. We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• 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)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Non-Linear Transformations of Quantum Amplitudes: Exponential Improvement, Generalization, and Applications [0.0]
  Quantum algorithms manipulate the amplitudes of quantum states to find solutions to computational problems. We present a framework for applying a general class of non-linear functions to the amplitudes of quantum states. Our work provides an important and efficient building block with potentially numerous applications in areas such as optimization, state preparation, quantum chemistry, and machine learning.
  arXiv  Detail & Related papers  (2023-09-18T14:57:21Z)
• Efficient quantum amplitude encoding of polynomial functions [0.0]
  We present and compare two efficient methods for encoding on real functions on $n$ qubits. First, we encode the linear function into the quantum registers with a swallow sequence multi-controlled gates. Second, we use this construction as a building block to achieve a block encoding of the amplitudes corresponding to the linear function.
  arXiv  Detail & Related papers  (2023-07-20T14:40:55Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Quantum state preparation without coherent arithmetic [5.478764356647437]
  We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function.magnitude existing approaches. We use a template quantum eigenvalue transformation circuit to convert a low cost block encoding of the sine function into the desired function.
  arXiv  Detail & Related papers  (2022-10-26T17:48:31Z)
• 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)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications [10.436969366019015]
  We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits. We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
  arXiv  Detail & Related papers  (2022-01-27T13:16:30Z)
• Quantum algorithms for approximate function loading [0.0]
  We introduce two approximate quantum-state preparation methods for the NISQ era inspired by the Grover-Rudolph algorithm. A variational algorithm capable of loading functions beyond the aforementioned smoothness conditions is proposed.
  arXiv  Detail & Related papers  (2021-11-15T17:36:13Z)
• On the energy landscape of symmetric quantum signal processing [1.5301252700705212]
  We prove that one particular global (called the global minimum) solution belongs to a $0$ on which the cost function is on which the cost function is a global. We provide an explanation of a partial explanation of optimization algorithms.
  arXiv  Detail & Related papers  (2021-10-11T04:16:48Z)
• Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions [0.8315657895474382]
  We show that there exist families of quantum states that can be prepared to high precision with circuits of linear size and depth. We further develop an algorithm that requires only linear classical time to generate accurate linear-depth circuits.
  arXiv  Detail & Related papers  (2020-05-09T02:31:44Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.