A generalized framework for quantum state discrimination, hybrid
algorithms, and the quantum change point problem
- URL: http://arxiv.org/abs/2312.04023v1
- Date: Thu, 7 Dec 2023 03:42:40 GMT
- Title: A generalized framework for quantum state discrimination, hybrid
algorithms, and the quantum change point problem
- Authors: Ankith Mohan, Jamie Sikora and Sarvagya Upadhyay
- Abstract summary: 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.
- Score: 3.4683494246563606
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum state discrimination is a central task in many quantum computing
settings where one wishes to identify what quantum state they are holding. We
introduce a framework that generalizes many of its variants and present a
hybrid quantum-classical algorithm based on semidefinite programming to
calculate the maximum reward when the states are pure and have efficient
circuits. To this end, we study the (not necessarily linearly independent) pure
state case and reduce the standard SDP problem size from $2^n L$ to $N L$ where
$n$ is the number of qubits, $N$ is the number of states, and $L$ is the number
of possible guesses (typically $L = N$). As an application, 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. With our reductions, we are able to solve SDPs for
problem sizes of up to $220$ qubits in about $8$ hours and we also give
heuristics which speed up the computations.
Related papers
- Quantum algorithms for Hopcroft's problem [45.45456673484445]
We study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry.
The classical complexity of this problem is well-studied, with the best known algorithm running in $O(n4/3)$ time.
Our results are two different quantum algorithms with time complexity $widetilde O(n5/6)$.
arXiv Detail & Related papers (2024-05-02T10:29:06Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - 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) - Multipartite High-dimensional Quantum State Engineering via Discrete
Time Quantum Walk [8.875659216970327]
We give two schemes for the engineering task of arbitrary quantum state in $c$-partite $d$-dimensional system.
A concrete example of preparing generalized Bell states is given to demonstrate the first scheme we proposed.
We also show how these schemes can be used to reduce the cost of long-distance quantum communication.
arXiv Detail & Related papers (2022-12-23T06:06:16Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - 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) - Deterministic and Entanglement-Efficient Preparation of
Amplitude-Encoded Quantum Registers [0.533024001730262]
A classical vector $mathbfb$ is encoded in the amplitudes of a quantum state.
An arbitrary state of $Q$ qubits generally requires approximately $2Q$ entangling gates.
We present a deterministic (nonvariational) algorithm that allows one to flexibly reduce the quantum resources required for state preparation.
arXiv Detail & Related papers (2021-10-26T07:37:54Z) - On Applying the Lackadaisical Quantum Walk Algorithm to Search for
Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$.
This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z) - 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.