Hybrid quantum algorithms for flow problems
For quantum computing (QC) to emerge as a practically indispensable computational tool,
there is a need for quantum protocols with end-to-end practical applications—in this …
there is a need for quantum protocols with end-to-end practical applications—in this …
Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective
We discuss here some aspects related to the symmetries of a quantum many-body problem
when trying to treat it on a quantum computer. Several features related to symmetry …
when trying to treat it on a quantum computer. Several features related to symmetry …
Simple quantum algorithm to efficiently prepare sparse states
State preparation is a fundamental routine in quantum computation, for which many
algorithms have been proposed. Among them, perhaps the simplest one is the Grover …
algorithms have been proposed. Among them, perhaps the simplest one is the Grover …
Qubit encoding for a mixture of localized functions
One of the crucial generic techniques for quantum computation is amplitude encoding.
Although several approaches have been proposed, each of them often requires exponential …
Although several approaches have been proposed, each of them often requires exponential …
Spin‐ss Dicke States and Their Preparation
The notion of su (2) su(2) spin‐ss Dicke states is introduced, which are higher‐spin
generalizations of usual (spin‐1/2) Dicke states. These multi‐qudit states can be expressed …
generalizations of usual (spin‐1/2) Dicke states. These multi‐qudit states can be expressed …
Circuit complexity of sparse quantum state preparation
Quantum state preparation is a fundamental and significant subroutine in quantum
computing. In this paper, we conduct a systematic investigation on the circuit size for sparse …
computing. In this paper, we conduct a systematic investigation on the circuit size for sparse …
A generalization of Bernstein–Vazirani algorithm with multiple secret keys and a probabilistic oracle
A Shukla, P Vedula - Quantum Information Processing, 2023 - Springer
A probabilistic version of the Bernstein–Vazirani problem (which is a generalization of the
original Bernstein–Vazirani problem) and a quantum algorithm to solve it are proposed. The …
original Bernstein–Vazirani problem) and a quantum algorithm to solve it are proposed. The …
Low-rank quantum state preparation
Ubiquitous in quantum computing is the step to encode data into a quantum state. This
process is called quantum state preparation, and its complexity for nonstructured data is …
process is called quantum state preparation, and its complexity for nonstructured data is …
Mixed-dimensional qudit state preparation using edge-weighted decision diagrams
Quantum computers have the potential to solve important problems which are fundamentally
intractable on a classical computer. The underlying physics of quantum computing platforms …
intractable on a classical computer. The underlying physics of quantum computing platforms …
Toward optimal circuit size for sparse quantum state preparation
Compared to general quantum states, the sparse states arise more frequently in the field of
quantum computation. In this work we consider the preparation for n-qubit sparse quantum …
quantum computation. In this work we consider the preparation for n-qubit sparse quantum …