Multi-state Swap Test Algorithm
- URL: http://arxiv.org/abs/2205.07171v1
- Date: Sun, 15 May 2022 03:31:57 GMT
- Title: Multi-state Swap Test Algorithm
- Authors: Wen Liu, Han-Wen Yin, Zhi-Rao Wang, Wen-Qin Fan
- Abstract summary: Estimating the overlap between two states is an important task with several applications in quantum information.
We design a quantum circuit to measure overlaps of multiple quantum states.
- Score: 2.709321785404766
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Estimating the overlap between two states is an important task with several
applications in quantum information. However, the typical swap test circuit can
only measure a sole pair of quantum states at a time. In this study we designed
a recursive quantum circuit to measure overlaps of multiple quantum states
$|\phi_1...\phi_n\rangle$ concurrently with $O(n\log n)$ controlled-swap
(CSWAP) gates and $O(\log n)$ ancillary qubits. This circuit enables us to get
all pairwise overlaps among input quantum states
$|\langle\phi_i|\phi_j\rangle|^2$. Compared with existing schemes for measuring
the overlap of multiple quantum states, our scheme provides higher precision
and less consumption of ancillary qubits. In addition, we performed simulation
experiments on IBM quantum cloud platform to verify the superiority of the
scheme.
Related papers
- Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Exploring quantum weight enumerators from the $n$-qubit parallelized SWAP test [19.183393329155567]
We build the connection between quantum weight enumerators and the $n$-qubit parallelized SWAP test.
We find that each shadow enumerator corresponds precisely to a probability in the $n$-qubit parallelized SWAP test.
For applications, we employ the $n$-qubit parallelized SWAP test to determine the distances of quantum error-correcting codes.
arXiv Detail & Related papers (2024-06-26T12:06:40Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - A generalized framework for quantum state discrimination, hybrid
algorithms, and the quantum change point problem [3.4683494246563606]
We present a hybrid quantum-classical algorithm based on semidefinite programming to calculate the maximum reward when the states are pure and have efficient circuits.
We give now-possible algorithms for the quantum change point identification problem which asks, given a sequence of quantum states, determine the time steps when the quantum states changed.
arXiv Detail & Related papers (2023-12-07T03:42:40Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Fast Quantum Algorithms for Trace Distance Estimation [8.646488471216262]
We propose efficient quantum algorithms for estimating the trace distance within additive error $varepsilon$ between mixed quantum states of rank $r$.
We show that the decision version of low-rank trace distance estimation is $mathsfBQP$-complete.
arXiv Detail & Related papers (2023-01-17T10:16:14Z) - Quantum Depth in the Random Oracle Model [57.663890114335736]
We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation.
For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
arXiv Detail & Related papers (2022-10-12T17:54:02Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - 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) - SWAP Test for an Arbitrary Number of Quantum States [4.989480853499916]
We develop an algorithm to generalize the quantum SWAP test for an arbitrary number $m$ of quantum states.
We construct a quantum circuit able to simultaneously measure overlaps of $m$ arbitrary pure states.
arXiv Detail & Related papers (2021-10-25T20:53: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.