Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2103.13211 · Physical Review Research

Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicators

Kouhei Nakaji, Shumpei Uno, Yohichi Suzuki, Rudy Raymond, Tamiya Onodera, Tomoki Tanaka, Hiroyuki Tezuka, Naoki Mitsuda, Naoki Yamamoto

Published May 20, 2022• 113 citations
arXivHTMLPDF

Abstract

Efficient methods for loading given classical data into quantum circuits are essential for various quantum algorithms. In this paper, we propose an algorithm called Approximate Amplitude Encoding that can effectively load all the components of a given real-valued data vector into the amplitude of quantum state, while the previous proposal can load only the absolute values of those components. The key of our algorithm is to variationally train a shallow parameterized quantum circuit, using the results of two types of measurement: the standard computational-basis measurement plus the measurement in the Hadamard-transformed basis, introduced in order to handle the sign of the data components. The variational algorithm changes the circuit parameters so as to minimize the sum of two costs corresponding to those two measurement basis, both of which are given by the efficiently computable maximum mean discrepancy. We also consider the problem of constructing the singular value decomposition entropy via the stock market data set to give a financial market indicator; a quantum algorithm (the variational singular value decomposition algorithm) is known to produce a solution faster than classical, which yet requires the sign-dependent amplitude encoding. We demonstrate, with an in-depth numerical analysis, that our algorithm realizes loading of time series of real stock prices on quantum state with small approximation error, and thereby it enables constructing an indicator of the financial market based on the stock prices.

DOI
10.1103/physrevresearch.4.023136

Related papers

Approximate complex amplitude encoding algorithm and its application to data classification problems

Naoki Mitsuda, Tatsuhiro Ichimura, Kouhei Nakaji +6 more

Quantum computing has a potential to accelerate data processing efficiency, especially in machine learning, by exploiting special features such as the quantum interference. The major challenge in this application is that, in general, the task of loading a classical data vector into a quantum state requires an exponential number of quantum gates. The approximate amplitude encoding (AAE) method, which uses a variational means to approximately load a given real-valued data vector into the amplitude of a quantum state, was recently proposed as a general approach to this problem mainly for near-term devices. However, AAE cannot load a complex-valued data vector, which narrows its application range. In this work, we extend AAE so that it can handle a complex-valued data vector. The key idea is to employ the fidelity distance as a cost function for optimizing a parametrized quantum circuit, where the classical shadow technique is used to efficiently estimate the fidelity and its gradient. We apply this algorithm to realize the complex-valued-kernel binary classifier called the compact Hadamard classifier, and then we present a numerical experiment showing that it enables classification of the Iris dataset and credit card fraud detection.

arXiv:2211.13039•Physical Review A•May 13, 2024•31 citations

Genetically Engineered Quantum Circuits for Financial Market Indicators

Floyd M. Creevey, Lloyd C. L. Hollenberg

Quantum computing holds immense potential for transforming financial analysis and decision-making. Realising this potential necessitates the efficient encoding and processing of financial data on quantum computers. In this study, we propose using the GASP (Genetic Algorithm for State Preparation) framework to optimise the encoding of stock price data into quantum states and show it can enhance both the fidelity and efficiency of the encoding process. We demonstrate the efficacy of our approach by encoding stock price data onto both a simulated and real quantum computer to calculate the Singular Value Decomposition (SVD) entropy. Our results show improvements in fidelity and the potential for more precise financial analysis. This research provides insights into the applicability of GASP for the efficient encoding of real-world data, specifically stock price data, which is crucial for quantum advantage on noisy intermediate-scale quantum (NISQ) era quantum computers.

quant-pharXiv:2511.15739•Nov 19, 2025•0 citations

Efficient quantum amplitude encoding of polynomial functions

Javier Gonzalez-Conde, Thomas W. Watts, Pablo Rodriguez-Grasa +1 more

Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency of this process leads to a major bottleneck for the application of these algorithms. Here, we present and compare two efficient methods for the amplitude encoding of real polynomial functions on n qubits. This case holds special relevance, as any continuous function on a closed interval can be uniformly approximated with arbitrary precision by a polynomial function. The first approach relies on the matrix product state representation (MPS). We study and benchmark the approximations of the target state when the bond dimension is assumed to be small. The second algorithm combines two subroutines. Initially we encode the linear function into the quantum registers either via its MPS or with a shallow sequence of multi-controlled gates that loads the linear function's Hadamard-Walsh series, and we explore how truncating the Hadamard-Walsh series of the linear function affects the final fidelity. Applying the inverse discrete Hadamard-Walsh transform converts the state encoding the series coefficients into an amplitude encoding of the linear function. Thus, we use this construction as a building block to achieve an exact block encoding of the amplitudes corresponding to the linear function on k0 qubits and apply the quantum singular value transformation that implements a polynomial transformation to the block encoding of the amplitudes. This unitary together with the Amplitude Amplification algorithm will enable us to prepare the quantum state that encodes the polynomial function on k0 qubits. Finally we pad n−k0 qubits to generate an approximated encoding of the polynomial on n qubits, analyzing the error depending on k0 . In this regard, our methodology proposes a method to improve the state-of-the-art complexity by introducing controllable errors.

arXiv:2307.10917•Quantum•Mar 21, 2024•55 citations

Hamiltonian-based data loading with shallow quantum circuits

Bojia Duan, Chang‐Yu Hsieh

Data loading with shallow quantum circuits is a highly desirable ingredient for efficient execution of many quantum algorithms before large-scale quantum error corrections with full fault tolerance become readily available. The need for efficient data loading is especially urgent for the study of quantum machine learning. In this work, we propose a protocol that only uses a parameterized shallow quantum circuit without ancilla qubits for loading data into the amplitude of a quantum state with high fidelity. We term this data-loading method Hamiltonian-based data loading (HDL), which comprises two stages. First, the HDL algorithm identifies a Hamiltonian $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}$ whose unique ground state $|\ensuremath{\psi}\ensuremath{\rangle}$ represents the normalized data $\stackrel{P\vec}{x}$ in the form of amplitude encoding. Next, the target state is reconstructed with a parameterized quantum circuit by utilizing methods like variational quantum eigensolver to minimize energy. In this work, we provide three convincing examples to demonstrate the effectiveness of HDL for loading an $N$-dimensional classical data with minimal quantum resources ($O[\mathrm{poly}({log}_{2}N)]$-depth quantum circuit without ancilla qubits). Our approach is particularly useful for quantum hardware without large-scale error corrections, and shall benefit the development of quantum machine learning algorithms.

Physical Review A•Nov 18, 2022•8 citations

Quantum Architecture Search for Quantum Monte Carlo Integration via Conditional Parameterized Circuits with Application to Finance

Mark-Oliver Wolf, Tom Ewen, Ivica Turkalj

Classical Monte Carlo algorithms can theoretically be sped up on a quantum computer by employing amplitude estimation (AE). To realize this, an efficient implementation of state-dependent functions is crucial. We develop a straightforward approach based on pretraining parameterized quantum circuits, and show how they can be transformed into their conditional variant, making them usable as a subroutine in an AE algorithm. To identify a suitable circuit, we propose a genetic optimization approach that combines variable ansatzes and data encoding. We apply our algorithm to the problem of pricing financial derivatives. At the expense of a costly pretraining process, this results in a quantum circuit implementing the derivatives' payoff function more efficiently than previously existing quantum algorithms. In particular, we compare the performance for European vanilla and basket options.

arXiv:2304.08793•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•10 citations

Robustness of Quantum Algorithms Against Approximate Data Representations

Vladyslav Los, Mykola Maksymenko, Maciej Koch-Janusz +2 more

Quantum algorithms face practical difficulties and overheads in execution on realistic devices, potentially thwarting their theoretical advantages. A key practical challenge is efficiently encoding classical data, since data embedding layers, often exponential in the number of qubits, can consume a significant portion of the circuit depth. One possible strategy to address this is to compress the standard data embeddings using variational circuits. The approximate amplitude encoding (AAE) algorithm successfully applies this approach to financial calculations and image pattern matching, achieving only polynomially deep embedding layers. While prior works focus on optimizing the approximate embedding in isolation, the ultimate goal is the compound algorithm's performance. This study systematically examines the impact of embedding compression on the fidelity of the subsequent quantum algorithm in a noiseless setting, specifically investigating amplitude encoding and its dependence on input data set size and complexity. Trainability of the different variational ansaetze, their output state fidelity, and the degree of the embedding layer depth compression are investigated. Performance benchmarks of standard quantum algorithms, e.g. Grover search, amplitude estimation, and quantum Fourier transform (QFT), are conducted based on the degree of compression and quality of the compressed input state. Results show that the amplitude encoding circuit can be compressed substantially in depth, for generic data and a small number of qubits, with only marginal loss in state fidelity. Certain algorithms, like QFT, demonstrate robustness to such approximations.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•0 citations
Efficient methods for loading given classical data into quantum circuits are essential for various quantum algorithms. In this paper, we propose an algorithm called Approximate Amplitude Encoding that can effectively load all the components of a given real-valued data vector into the amplitude of quantum state, while the previous proposal can load only the absolute values of those components. The key of our algorithm is to variationally train a shallow parameterized quantum circuit, using the results of two types of measurement: the standard computational-basis measurement plus the measurement in the Hadamard-transformed basis, introduced in order to handle the sign of the data components. The variational algorithm changes the circuit parameters so as to minimize the sum of two costs corresponding to those two measurement basis, both of which are given by the efficiently computable maximum mean discrepancy. We also consider the problem of constructing the singular value decomposition entropy via the stock market data set to give a financial market indicator; a quantum algorithm (the variational singular value decomposition algorithm) is known to produce a solution faster than classical, which yet requires the sign-dependent amplitude encoding. We demonstrate, with an in-depth numerical analysis, that our algorithm realizes loading of time series of real stock prices on quantum state with small approximation error, and thereby it enables constructing an indicator of the financial market based on the stock prices.
Quantum computing has a potential to accelerate data processing efficiency, especially in machine learning, by exploiting special features such as the quantum interference. The major challenge in this application is that, in general, the task of loading a classical data vector into a quantum state requires an exponential number of quantum gates. The approximate amplitude encoding (AAE) method, which uses a variational means to approximately load a given real-valued data vector into the amplitude of a quantum state, was recently proposed as a general approach to this problem mainly for near-term devices. However, AAE cannot load a complex-valued data vector, which narrows its application range. In this work, we extend AAE so that it can handle a complex-valued data vector. The key idea is to employ the fidelity distance as a cost function for optimizing a parametrized quantum circuit, where the classical shadow technique is used to efficiently estimate the fidelity and its gradient. We apply this algorithm to realize the complex-valued-kernel binary classifier called the compact Hadamard classifier, and then we present a numerical experiment showing that it enables classification of the Iris dataset and credit card fraud detection.
Quantum computing holds immense potential for transforming financial analysis and decision-making. Realising this potential necessitates the efficient encoding and processing of financial data on quantum computers. In this study, we propose using the GASP (Genetic Algorithm for State Preparation) framework to optimise the encoding of stock price data into quantum states and show it can enhance both the fidelity and efficiency of the encoding process. We demonstrate the efficacy of our approach by encoding stock price data onto both a simulated and real quantum computer to calculate the Singular Value Decomposition (SVD) entropy. Our results show improvements in fidelity and the potential for more precise financial analysis. This research provides insights into the applicability of GASP for the efficient encoding of real-world data, specifically stock price data, which is crucial for quantum advantage on noisy intermediate-scale quantum (NISQ) era quantum computers.
Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency of this process leads to a major bottleneck for the application of these algorithms. Here, we present and compare two efficient methods for the amplitude encoding of real polynomial functions on n qubits. This case holds special relevance, as any continuous function on a closed interval can be uniformly approximated with arbitrary precision by a polynomial function. The first approach relies on the matrix product state representation (MPS). We study and benchmark the approximations of the target state when the bond dimension is assumed to be small. The second algorithm combines two subroutines. Initially we encode the linear function into the quantum registers either via its MPS or with a shallow sequence of multi-controlled gates that loads the linear function's Hadamard-Walsh series, and we explore how truncating the Hadamard-Walsh series of the linear function affects the final fidelity. Applying the inverse discrete Hadamard-Walsh transform converts the state encoding the series coefficients into an amplitude encoding of the linear function. Thus, we use this construction as a building block to achieve an exact block encoding of the amplitudes corresponding to the linear function on k0 qubits and apply the quantum singular value transformation that implements a polynomial transformation to the block encoding of the amplitudes. This unitary together with the Amplitude Amplification algorithm will enable us to prepare the quantum state that encodes the polynomial function on k0 qubits. Finally we pad n−k0 qubits to generate an approximated encoding of the polynomial on n qubits, analyzing the error depending on k0 . In this regard, our methodology proposes a method to improve the state-of-the-art complexity by introducing controllable errors.
Data loading with shallow quantum circuits is a highly desirable ingredient for efficient execution of many quantum algorithms before large-scale quantum error corrections with full fault tolerance become readily available. The need for efficient data loading is especially urgent for the study of quantum machine learning. In this work, we propose a protocol that only uses a parameterized shallow quantum circuit without ancilla qubits for loading data into the amplitude of a quantum state with high fidelity. We term this data-loading method Hamiltonian-based data loading (HDL), which comprises two stages. First, the HDL algorithm identifies a Hamiltonian $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}$ whose unique ground state $|\ensuremath{\psi}\ensuremath{\rangle}$ represents the normalized data $\stackrel{P\vec}{x}$ in the form of amplitude encoding. Next, the target state is reconstructed with a parameterized quantum circuit by utilizing methods like variational quantum eigensolver to minimize energy. In this work, we provide three convincing examples to demonstrate the effectiveness of HDL for loading an NNN-dimensional classical data with minimal quantum resources (O[poly(log2N)]O[\mathrm{poly}({log}_{2}N)]O[poly(log2​N)]-depth quantum circuit without ancilla qubits). Our approach is particularly useful for quantum hardware without large-scale error corrections, and shall benefit the development of quantum machine learning algorithms.
Classical Monte Carlo algorithms can theoretically be sped up on a quantum computer by employing amplitude estimation (AE). To realize this, an efficient implementation of state-dependent functions is crucial. We develop a straightforward approach based on pretraining parameterized quantum circuits, and show how they can be transformed into their conditional variant, making them usable as a subroutine in an AE algorithm. To identify a suitable circuit, we propose a genetic optimization approach that combines variable ansatzes and data encoding. We apply our algorithm to the problem of pricing financial derivatives. At the expense of a costly pretraining process, this results in a quantum circuit implementing the derivatives' payoff function more efficiently than previously existing quantum algorithms. In particular, we compare the performance for European vanilla and basket options.
Quantum algorithms face practical difficulties and overheads in execution on realistic devices, potentially thwarting their theoretical advantages. A key practical challenge is efficiently encoding classical data, since data embedding layers, often exponential in the number of qubits, can consume a significant portion of the circuit depth. One possible strategy to address this is to compress the standard data embeddings using variational circuits. The approximate amplitude encoding (AAE) algorithm successfully applies this approach to financial calculations and image pattern matching, achieving only polynomially deep embedding layers. While prior works focus on optimizing the approximate embedding in isolation, the ultimate goal is the compound algorithm's performance. This study systematically examines the impact of embedding compression on the fidelity of the subsequent quantum algorithm in a noiseless setting, specifically investigating amplitude encoding and its dependence on input data set size and complexity. Trainability of the different variational ansaetze, their output state fidelity, and the degree of the embedding layer depth compression are investigated. Performance benchmarks of standard quantum algorithms, e.g. Grover search, amplitude estimation, and quantum Fourier transform (QFT), are conducted based on the degree of compression and quality of the compressed input state. Results show that the amplitude encoding circuit can be compressed substantially in depth, for generic data and a small number of qubits, with only marginal loss in state fidelity. Certain algorithms, like QFT, demonstrate robustness to such approximations.