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:2411.19072

Shallow Quantum Scalar Products with Phase Information

Lila Cadi Tazi, David Muñoz Ramo, Alex J. W. Thom

Published Nov 28, 2024• 6 citations
arXivHTMLPDF

Abstract

The measurement of scalar products between two vectors is a common task in scientific computing and, by extension, in quantum computing. In this work, we introduce two alternative quantum circuits for computing scalar products with phase information, combining the structure of the swap test, the vacuum test, and the Hadamard test. These novel frameworks, called the zero-control and one-control tests, present different trade-offs between circuit depth and qubit count for accessing the scalar product between two quantum states. We demonstrate that our approach significantly reduces the gate count for large numbers of qubits and decreases the scaling of quantum requirements compared to the Hadamard test.

DOI
10.48550/arxiv.2411.19072

Related papers

Phase-Sensitive Quantum Measurement without Controlled Operations

Yilun Yang, Arthur Christianen, Mari Carmen Bañuls +2 more

Many quantum algorithms rely on the measurement of complex quantum amplitudes. Standard approaches to obtain the phase information, such as the Hadamard test, give rise to large overheads due to the need for global controlled-unitary operations. We introduce a quantum algorithm based on complex analysis that overcomes this problem for amplitudes that are a continuous function of time. Our method only requires the implementation of real-time evolution and a shallow circuit that approximates a short imaginary-time evolution. We show that the method outperforms the Hadamard test in terms of circuit depth and that it is suitable for current noisy quantum computers when combined with a simple error-mitigation strategy.

arXiv:2308.10796•Physical Review Letters•May 28, 2024•19 citations

Parallel Hadamard Test

Soichiro Imamura, Synge Todo

The Hadamard test is a fundamental building block widely used in many quantum computing algorithms. It estimates the real or imaginary part of $\langle ψ\vert U \vert ψ\rangle$, where $\vert ψ\rangle$ is a quantum state and $U$ is a unitary operator. In many algorithms, however, many such quantities must be estimated, leading to a large number of distinct circuit types, long computational times, and high financial costs. In this work, we propose the parallel Hadamard test, which combines multiple Hadamard tests into a single circuit type. We demonstrate how the parallel Hadamard test applies to three structural classes of workloads: arbitrary sets of unitary operators, prefix-product arrays, and Gram-matrix elements. For each class, we compare the cost of the parallel Hadamard test with that of the conventional one. Our unified approach significantly reduces the number of distinct circuit types, and can lower both computational time and financial costs in regimes where fixed per-circuit overheads dominate the total cost. In Gram-matrix workloads, it can also reduce the total number of shots when typical off-diagonal overlaps are small.

quant-pharXiv:2607.12344•Jul 15, 2026•1 citation

Quantum circuits for calculating the squared sum of the inner product of quantum states and its application

Panchi Li, Jiahui Guo, Bing Wang +1 more

In this paper, we propose a quantum circuit for calculating the squared sum of the inner product of quantum states. The circuit is designed by the multi-qubits controlled-swapping gates, in which the initial state of each control qubit is [Formula: see text] and they are in the equilibrium superposition state after passing through some Hadamard gates. Then, according to the control rules, each basis state in the superposition state controls the corresponding quantum states pair to swap. Finally, the Hadamard gates are applied to the control qubits again, and the squared sum of the inner product of many pairs of quantum states can be obtained simultaneously by measuring only one control qubit. We investigate the application of this method in quantum images matching on a classical computer, and the experimental results verify the correctness of the proposed method.

International Journal of Quantum Information•Aug 1, 2019•4 citations

Modelling and testing multi-qubit universal control gate developed for quantum computing systems

Bayram Ashyrmyradovich Jumayev

Quantum gates are building blocks of quantum circuits and they are used to carry out corresponding operations on quantum bits or qubits. The distinguishing feature of multi-qubit quantum control-gates is that they act on target qubits according to the state of control qubit(s). In this sense, there exist 2- and 3-qubit quantum gates such as Controlled-NOT, Toffoli (Controlled-Controlled-NOT), Controlled-Hadamard, Controlled-Swap and so on. In order to make complex quantum circuits easier and control more qubits, it is necessary to work out mathematical models of new control gates acting on more than three qubits depending on the state of control qubit. Therefore, in this work, mathematical model of multi-qubit universal control gate is worked out and some control gates are formulated in accordance with the proposed model, moreover the tests of these novel control gates are carried out using online open resource or virtual laboratory that is called “Quirk”. Existing 2- and 3-qubit control gates can also be derived using this model. Matrix representations of Controlled-NOT-NOT, Controlled-Hadamard-Hadamard, Controlled-NOT-NOT-Hadamard, Controlled-Hadamard-Swap and Controlled-Hadamard-SWAP-NOT gates are derived using the proposed mathematical model. These quantum gates are unitary and reversible gates. Using the proposed model and novel quantum gates will help to reduce complexity of quantum circuits and develop new cryptographic algorithms.

International Conference on Computer Systems and Technologies (CompSysTech)•Jun 17, 2022•1 citation

A Quantum Phase-based Comparator

Alessandro Berti, Alessandro Poggiali

Quantum comparators decide the order of two operands. They rely on reversible logic acting on basis-encoded integers, so their width grows with the precision. We introduce the Quantum Phase-based Comparator (QPC), which compares two values carried in relative phases instead. The circuit places the two phases, entered with opposite signs, between a pair of Hadamard gates, and a fixed offset centers the interference, so that the probability of measuring zero falls below one half exactly when the first phase is the smaller. We give two implementations. With hard-coded values, the two values are written into the parameters of two phase gates, and the comparison costs one qubit and five gates. With the register-driven cascade, the values are drawn from two $t$-qubit registers through binary-weighted controlled-phase gates, at a cost of one qubit beyond the registers and depth linear in $t$; since the cascade induces each phase linearly from the register content, one circuit handles a superposition of operand pairs. The readout yields a biased coin rather than a definite bit, and we quantify the shots that a decision takes at a given phase separation. Scaling both phases by an integer widens the decision margin at no cost in width or depth, and an adaptive doubling schedule turns this amplification into a shot count logarithmic in the inverse separation.

quant-pharXiv:2609.25262•Sep 23, 2026•0 citations

Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations

Yu-Hang Liu, Yuan-Hong Tao, Jing-Run Lan +1 more

This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs.

quant-pharXiv:2511.02413•Nov 5, 2025•1 citation
The measurement of scalar products between two vectors is a common task in scientific computing and, by extension, in quantum computing. In this work, we introduce two alternative quantum circuits for computing scalar products with phase information, combining the structure of the swap test, the vacuum test, and the Hadamard test. These novel frameworks, called the zero-control and one-control tests, present different trade-offs between circuit depth and qubit count for accessing the scalar product between two quantum states. We demonstrate that our approach significantly reduces the gate count for large numbers of qubits and decreases the scaling of quantum requirements compared to the Hadamard test.
Many quantum algorithms rely on the measurement of complex quantum amplitudes. Standard approaches to obtain the phase information, such as the Hadamard test, give rise to large overheads due to the need for global controlled-unitary operations. We introduce a quantum algorithm based on complex analysis that overcomes this problem for amplitudes that are a continuous function of time. Our method only requires the implementation of real-time evolution and a shallow circuit that approximates a short imaginary-time evolution. We show that the method outperforms the Hadamard test in terms of circuit depth and that it is suitable for current noisy quantum computers when combined with a simple error-mitigation strategy.
The Hadamard test is a fundamental building block widely used in many quantum computing algorithms. It estimates the real or imaginary part of ⟨ψ∣U∣ψ⟩\langle ψ\vert U \vert ψ\rangle⟨ψ∣U∣ψ⟩, where ∣ψ⟩\vert ψ\rangle∣ψ⟩ is a quantum state and UUU is a unitary operator. In many algorithms, however, many such quantities must be estimated, leading to a large number of distinct circuit types, long computational times, and high financial costs. In this work, we propose the parallel Hadamard test, which combines multiple Hadamard tests into a single circuit type. We demonstrate how the parallel Hadamard test applies to three structural classes of workloads: arbitrary sets of unitary operators, prefix-product arrays, and Gram-matrix elements. For each class, we compare the cost of the parallel Hadamard test with that of the conventional one. Our unified approach significantly reduces the number of distinct circuit types, and can lower both computational time and financial costs in regimes where fixed per-circuit overheads dominate the total cost. In Gram-matrix workloads, it can also reduce the total number of shots when typical off-diagonal overlaps are small.
In this paper, we propose a quantum circuit for calculating the squared sum of the inner product of quantum states. The circuit is designed by the multi-qubits controlled-swapping gates, in which the initial state of each control qubit is [Formula: see text] and they are in the equilibrium superposition state after passing through some Hadamard gates. Then, according to the control rules, each basis state in the superposition state controls the corresponding quantum states pair to swap. Finally, the Hadamard gates are applied to the control qubits again, and the squared sum of the inner product of many pairs of quantum states can be obtained simultaneously by measuring only one control qubit. We investigate the application of this method in quantum images matching on a classical computer, and the experimental results verify the correctness of the proposed method.
Quantum gates are building blocks of quantum circuits and they are used to carry out corresponding operations on quantum bits or qubits. The distinguishing feature of multi-qubit quantum control-gates is that they act on target qubits according to the state of control qubit(s). In this sense, there exist 2- and 3-qubit quantum gates such as Controlled-NOT, Toffoli (Controlled-Controlled-NOT), Controlled-Hadamard, Controlled-Swap and so on. In order to make complex quantum circuits easier and control more qubits, it is necessary to work out mathematical models of new control gates acting on more than three qubits depending on the state of control qubit. Therefore, in this work, mathematical model of multi-qubit universal control gate is worked out and some control gates are formulated in accordance with the proposed model, moreover the tests of these novel control gates are carried out using online open resource or virtual laboratory that is called “Quirk”. Existing 2- and 3-qubit control gates can also be derived using this model. Matrix representations of Controlled-NOT-NOT, Controlled-Hadamard-Hadamard, Controlled-NOT-NOT-Hadamard, Controlled-Hadamard-Swap and Controlled-Hadamard-SWAP-NOT gates are derived using the proposed mathematical model. These quantum gates are unitary and reversible gates. Using the proposed model and novel quantum gates will help to reduce complexity of quantum circuits and develop new cryptographic algorithms.
Quantum comparators decide the order of two operands. They rely on reversible logic acting on basis-encoded integers, so their width grows with the precision. We introduce the Quantum Phase-based Comparator (QPC), which compares two values carried in relative phases instead. The circuit places the two phases, entered with opposite signs, between a pair of Hadamard gates, and a fixed offset centers the interference, so that the probability of measuring zero falls below one half exactly when the first phase is the smaller. We give two implementations. With hard-coded values, the two values are written into the parameters of two phase gates, and the comparison costs one qubit and five gates. With the register-driven cascade, the values are drawn from two ttt-qubit registers through binary-weighted controlled-phase gates, at a cost of one qubit beyond the registers and depth linear in ttt; since the cascade induces each phase linearly from the register content, one circuit handles a superposition of operand pairs. The readout yields a biased coin rather than a definite bit, and we quantify the shots that a decision takes at a given phase separation. Scaling both phases by an integer widens the decision margin at no cost in width or depth, and an adaptive doubling schedule turns this amplification into a shot count logarithmic in the inverse separation.
This paper focuses on quantum algorithms for three key matrix operations: Hadamard (Schur) product, Kronecker (tensor) product, and elementary column transformations each. By designing specific unitary transformations and auxiliary quantum measurement, efficient quantum schemes with circuit diagrams are proposed. Their computational depths are: O(1) for Kronecker product; O(max(m,n)) for Hadamard product (linked to matrix dimensions); and O(m) for elementary column transformations of (2^n X 2^m) matrices (dependent only on column count).Notably, compared to traditional column transformation via matrix transposition and row transformations, this scheme reduces computation steps and quantum gate usage, lowering quantum computing energy costs.