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

Chapman & Hall/CRC eBooks

Amplitude Encoding

Andreas Wichert

Published Nov 28, 2023• 0 citations
Publisher

Abstract

Amplitude encoding encodes a real or complexed value vector of the length one into the amplitudes of a quantum state. We describe the top-down strategy and indicate the algorithm step by step. Then we describe the combining states strategy. Instead of representing the binary tree by multi-control rotation gates, we can use controlled SWAP operators with simple rotation gates. The resulting circuits depth is less than top-down divide strategy, however, we require the same number of qubits as the number of rotation gates and the qubits are entangled after the operation.

DOI
10.1201/9781003374404-16

Related papers

Comparative study of amplitude versus angle encoding in gate-based quantum machine learning

Shashank Kumar, Ashok Kumar

We investigate two fundamental data encoding strategies for gate-based quantum computers: amplitude encoding and angle encoding. In amplitude encoding, a normalized -dimensional classical vector is mapped into the probability amplitudes of a -qubit quantum state, whereas angle encoding uses one or more single-qubit rotation gates per feature to encode data as angles.[1, 2] We construct a toy binary classification dataset with four real-valued features and compare these encoding schemes using a variational quantum classifier (VQC) approach. Our results indicate that angle encoding often yields slightly higher classification accuracy (e.g. 82% vs. 75% in one experiment) at the cost of requiring more qubits, while amplitude encoding compresses features into fewer qubits (2 vs. 4) but demands deeper state-preparation circuits. These findings align with previous studies that report higher accuracy for rotation encodings (e.g. vs. in MNIST experiments [3]) and note that the encoding choice acts as a hyperparameter affecting VQC performance. [4]

International Journal of Physics and Mathematics•Jul 1, 2025•2 citations

Scalable Unitary State-Encoding for Generic Large Data

Vittorio Pagni, Peter K. Schuhmacher, Michael Felderer +2 more

Efficient encoding of data into quantum states remains a fundamental bottleneck in many quantum computing protocols, which would otherwise offer advantages over their classical counterparts. Here, we introduce deterministic and scalable amplitude-encoding methods with low two-qubit gate costs and tunable trade-offs between circuit depth and encoding fidelity. Our approaches require no amplitude amplification or mid-circuit measurement and are capable of encoding arbitrary complex data or queryable functions by using tensor-networks to go beyond what can be held in classical memory. Our principle contributions are two complementary algorithms for simplifying fully controlled multiplexer circuits to one- and two-qubit gates. In the first, we formally map the elimination of redundant gate controls to a Boolean logic minimization problem, while in the second we utilize a single ancilla qubit to map the multi-controlled rotation gates to a sequence of one- and two-qubit operations via the Walsh-Hadamard spectrum of the gate angles. We benchmark these methods across a broad range of function classes, characterizing their total depth in an all-to-all connectivity graph against system size and target fidelity. Hybridizing our methods gives up to orders of magnitude improvement in circuit depth at equivalent state fidelity compared to the default state-preparation method in the Qiskit package. We furthermore demonstrate our method on IQM hardware with a square lattice connectivity, finding excellent fidelity, even with minimal noise mitigation. By significantly reducing gate depth for encoding, this work enables the experimental execution of applications on current and near-term hardware which would otherwise be reduced to noise before the first calculation step, shortening the time horizon to robust quantum utility.

arXiv:2611.09760•Nov 6, 2026•0 citations

Quantum State Preparation for Complex-Valued Amplitudes

Fred Sun

We present a state preparation procedure that takes binary registers containing the real and imaginary parts of a complex number $z=x+iy$ and prepares an amplitude approximating $z/α$, where $α$ is a normalization constant. The magnitude and argument are computed using the Coordinate Rotation Digital Computer (CORDIC) algorithm. We then encode the magnitude into an amplitude, and apply phase gates to introduce the argument. A reversible in-place multiplier allows the coordinate updates to use fixed precision while clearing their temporary workspace. The procedure uses $O(n^2)$ $T$ gates and $O(n)$ additional qubits. Compared with separately encoding the real and imaginary parts and combining them through LCU, the construction can allow a smaller normalization and reduce amplitude-amplification costs. The computed polar representation also remains available for further arithmetic before amplitude-encoding.

quant-pharXiv:2610.36680•Oct 28, 2026•0 citations

Quantum Box-Muller Transform

Dinh-Long Vu, Hitomi Mori, Patrick Rebentrost

The Box-Muller transform is a widely used method to generate Gaussian samples from uniform samples. Quantum amplitude encoding methods encode the multi-variate normal distribution in the amplitudes of a quantum state. This work presents the Quantum Box-Muller transform which creates a superposition of binary-encoded grid points representing the multi-variate normal distribution. The gate complexity of our method depends on quantum arithmetic operations and, using a specific set of known implementations, the complexity is quadratic in the number of qubits. We apply our method to Monte-Carlo integration, in particular to the estimation of the expectation value of a function of Gaussian random variables. Our method implies that the state preparation circuit used multiple times in amplitude estimation requires only quantum arithmetic circuits for the grid points and the function, in addition to a single controlled rotation. We show how to provide the expectation value estimate with an error that is exponentially small in the number of qubits, similar to the amplitude-encoding setting with error-free encoding.

quant-pharXiv:2601.13718•Jan 21, 2026•0 citations

Sublinear Classical-to-Quantum Data Encoding Using nnn-Toffoli Gates

Vittorio Pagni, Gary Schmiedinghoff, Kevin Lively +2 more

Quantum state preparation, also known as encoding or embedding, is a crucial initial step in many quantum algorithms and often constrains theoretical quantum speedup in fields such as quantum machine learning and linear equation solvers. One common strategy is amplitude encoding, which embeds a classical input vector of size$\mathrm{N}=2^{\mathrm{n}}$in the amplitudes of an n-qubit register. For arbitrary vectors, the circuit depth typically scales linearly with the input size N, rapidly becoming unfeasible on near-term hardware. We propose a general-purpose procedure with sublinear average depth in N, increasing the window of utility. Our amplitude encoding method encodes arbitrary complex vectors of size$\mathrm{N}=2^{n}$at any desired binary precision using a register with$n$qubits plus 2 ancillas and a sublinear number of multi-controlled NOT (MCX) gates, at the cost of a probabilistic success rate proportional to the sparsity of the encoded data. The core idea of our procedure is to construct an isomorphism between target states and hypercube graphs, in which specific reflections correspond to MCX gates. This reformulates the state preparation problem in terms of permutations and binary addition. The use of MCX gates as fundamental operations makes this approach particularly suitable for quantum platforms such as ion traps and neutral atom devices. This geometrical perspective paves the way for more gate-efficient algorithms suitable for nearterm hardware applications.

arXiv:2505.06054•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 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
Amplitude encoding encodes a real or complexed value vector of the length one into the amplitudes of a quantum state. We describe the top-down strategy and indicate the algorithm step by step. Then we describe the combining states strategy. Instead of representing the binary tree by multi-control rotation gates, we can use controlled SWAP operators with simple rotation gates. The resulting circuits depth is less than top-down divide strategy, however, we require the same number of qubits as the number of rotation gates and the qubits are entangled after the operation.
We investigate two fundamental data encoding strategies for gate-based quantum computers: amplitude encoding and angle encoding. In amplitude encoding, a normalized -dimensional classical vector is mapped into the probability amplitudes of a -qubit quantum state, whereas angle encoding uses one or more single-qubit rotation gates per feature to encode data as angles.[1, 2] We construct a toy binary classification dataset with four real-valued features and compare these encoding schemes using a variational quantum classifier (VQC) approach. Our results indicate that angle encoding often yields slightly higher classification accuracy (e.g. 82% vs. 75% in one experiment) at the cost of requiring more qubits, while amplitude encoding compresses features into fewer qubits (2 vs. 4) but demands deeper state-preparation circuits. These findings align with previous studies that report higher accuracy for rotation encodings (e.g. vs. in MNIST experiments [3]) and note that the encoding choice acts as a hyperparameter affecting VQC performance. [4]
Efficient encoding of data into quantum states remains a fundamental bottleneck in many quantum computing protocols, which would otherwise offer advantages over their classical counterparts. Here, we introduce deterministic and scalable amplitude-encoding methods with low two-qubit gate costs and tunable trade-offs between circuit depth and encoding fidelity. Our approaches require no amplitude amplification or mid-circuit measurement and are capable of encoding arbitrary complex data or queryable functions by using tensor-networks to go beyond what can be held in classical memory. Our principle contributions are two complementary algorithms for simplifying fully controlled multiplexer circuits to one- and two-qubit gates. In the first, we formally map the elimination of redundant gate controls to a Boolean logic minimization problem, while in the second we utilize a single ancilla qubit to map the multi-controlled rotation gates to a sequence of one- and two-qubit operations via the Walsh-Hadamard spectrum of the gate angles. We benchmark these methods across a broad range of function classes, characterizing their total depth in an all-to-all connectivity graph against system size and target fidelity. Hybridizing our methods gives up to orders of magnitude improvement in circuit depth at equivalent state fidelity compared to the default state-preparation method in the Qiskit package. We furthermore demonstrate our method on IQM hardware with a square lattice connectivity, finding excellent fidelity, even with minimal noise mitigation. By significantly reducing gate depth for encoding, this work enables the experimental execution of applications on current and near-term hardware which would otherwise be reduced to noise before the first calculation step, shortening the time horizon to robust quantum utility.
We present a state preparation procedure that takes binary registers containing the real and imaginary parts of a complex number z=x+iyz=x+iyz=x+iy and prepares an amplitude approximating z/αz/αz/α, where ααα is a normalization constant. The magnitude and argument are computed using the Coordinate Rotation Digital Computer (CORDIC) algorithm. We then encode the magnitude into an amplitude, and apply phase gates to introduce the argument. A reversible in-place multiplier allows the coordinate updates to use fixed precision while clearing their temporary workspace. The procedure uses O(n2)O(n^2)O(n2) TTT gates and O(n)O(n)O(n) additional qubits. Compared with separately encoding the real and imaginary parts and combining them through LCU, the construction can allow a smaller normalization and reduce amplitude-amplification costs. The computed polar representation also remains available for further arithmetic before amplitude-encoding.
The Box-Muller transform is a widely used method to generate Gaussian samples from uniform samples. Quantum amplitude encoding methods encode the multi-variate normal distribution in the amplitudes of a quantum state. This work presents the Quantum Box-Muller transform which creates a superposition of binary-encoded grid points representing the multi-variate normal distribution. The gate complexity of our method depends on quantum arithmetic operations and, using a specific set of known implementations, the complexity is quadratic in the number of qubits. We apply our method to Monte-Carlo integration, in particular to the estimation of the expectation value of a function of Gaussian random variables. Our method implies that the state preparation circuit used multiple times in amplitude estimation requires only quantum arithmetic circuits for the grid points and the function, in addition to a single controlled rotation. We show how to provide the expectation value estimate with an error that is exponentially small in the number of qubits, similar to the amplitude-encoding setting with error-free encoding.
Quantum state preparation, also known as encoding or embedding, is a crucial initial step in many quantum algorithms and often constrains theoretical quantum speedup in fields such as quantum machine learning and linear equation solvers. One common strategy is amplitude encoding, which embeds a classical input vector of sizeN=2n\mathrm{N}=2^{\mathrm{n}}N=2nin the amplitudes of an n-qubit register. For arbitrary vectors, the circuit depth typically scales linearly with the input size N, rapidly becoming unfeasible on near-term hardware. We propose a general-purpose procedure with sublinear average depth in N, increasing the window of utility. Our amplitude encoding method encodes arbitrary complex vectors of sizeN=2n\mathrm{N}=2^{n}N=2nat any desired binary precision using a register withnnnqubits plus 2 ancillas and a sublinear number of multi-controlled NOT (MCX) gates, at the cost of a probabilistic success rate proportional to the sparsity of the encoded data. The core idea of our procedure is to construct an isomorphism between target states and hypercube graphs, in which specific reflections correspond to MCX gates. This reformulates the state preparation problem in terms of permutations and binary addition. The use of MCX gates as fundamental operations makes this approach particularly suitable for quantum platforms such as ion traps and neutral atom devices. This geometrical perspective paves the way for more gate-efficient algorithms suitable for nearterm hardware applications.
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.