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

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 only load 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 dataset 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.

arXiv comment22 pages, 7 figures

References in corpus (51)

• Quantum Machine Learning
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• Quantum support vector machine for big data classification
• Quantum Amplitude Amplification and Estimation
• Noise Dressing of Financial Correlation Matrices
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Circuit-centric quantum classifiers
• Universal and non-universal properties of cross-correlations in financial time series
• Quantum random access memory
• A Random Matrix Approach to Cross-Correlations in Financial Data
• Synthesis of Quantum Logic Circuits
• Quantum Data Fitting
• Quantum machine learning: a classical perspective
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Quantum-state preparation with universal gate decompositions
• Dynamic asset trees and Black Monday
• Minimal Universal Two-qubit Quantum Circuits
• Differentiable Learning of Quantum Circuit Born Machine
• Prediction by linear regression on a quantum computer
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Implementing a distance-based classifier with a quantum interference circuit
• Efficient decomposition of quantum gates
• Quantum Circuits for Isometries
• Efficient estimation of Pauli observables by derandomization
• Random Matrix Theory Analysis of Cross Correlations in Financial Markets
• Quantum circuits with uniformly controlled one-qubit gates
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Large gradients via correlation in random parameterized quantum circuits
• Circuit-Based Quantum Random Access Memory for Classical Data
• Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• Black-box quantum state preparation without arithmetic
• Correlation and Network Topologies in Global and Local Stock Indices
• Expressibility of the alternating layered ansatz for quantum computation
• Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
• Quantum Singular Value Decomposer
• Dynamic evolution of cross-correlations in the Chinese stock market
• Quantum unary approach to option pricing
• Faster Amplitude Estimation
• Quantum Circuits for Sparse Isometries
• A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain
• Fast Black-Box Quantum State Preparation Based on Linear Combination of Unitaries

Cited by in corpus (37)

• Quantum computing for finance
• Efficient quantum amplitude encoding of polynomial functions
• Quantum algorithms for approximate function loading
• SVD Entanglement Entropy
• Low-rank quantum state preparation
• A performance characterization of quantum generative models
• How quantum computing can enhance biomarker discovery
• A duplication-free quantum neural network for universal approximation
• Quantum Transfer Learning with Adversarial Robustness for Classification of High-Resolution Image Datasets
• Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport
• Approximate complex amplitude encoding algorithm and its application to data classification problems
• Approximate encoding of quantum states using shallow circuits
• Quantum algorithms for scientific computing
• Quantum algorithm for partial differential equations of non-conservative systems with spatially varying parameters
• Automatic quantum circuit encoding of a given arbitrary quantum state
• The role of data embedding in equivariant quantum convolutional neural networks
• Variational quantum algorithm for generalized eigenvalue problems and its application to the finite element method
• Improved iterative quantum algorithm for ground-state preparation
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Assisted quantum simulation of open quantum systems
• Quantum Algorithm for Estimating Betti Numbers Using Cohomology Approach
• Supervised Learning Guarantee for Quantum AdaBoost
• Quantum Multiplexer Simplification for State Preparation
• Quantum Circuit Distillation and Compression
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Quantum-Enhanced Simulation-Based Optimization for Newsvendor Problems
• Random Projection using Random Quantum Circuits
• Quantum state preparation via piecewise QSVT
• Towards Improved Quantum Machine Learning for Molecular Force Fields
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates
• Fast Quantum Amplitude Encoding of Typical Classical Data
• Many-body thermal states on a quantum computer: a variational approach
• Applying Quantum Autoencoders for Time Series Anomaly Detection
• Quantum-Enhanced Neural Exchange-Correlation Functionals
• Verifiable cloud-based variational quantum algorithms
• Nonlinear path-following via the asymptotic numerical method on a quantum processor
• Comment on arXiv:2307.08384 "Efficient Quantum State Preparation with Walsh Series"