Related papers: Efficient quantum algorithm to construct arbitrary…
We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
It is presently shown that the Deutsch-Jozsa algorithm is connected to the concept of bent function. Particularly, it is noticeable that the quantum circuit used to denote the well known quantum algorithm is by itself the quantum computer…
We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm…
The preparation and computation of many properties of quantum Gibbs states is essential for algorithms such as quantum semidefinite programming and quantum Boltzmann machines. We propose a quantum algorithm that can predict $M$ linear…
Production and verification of multipartite quantum state are an essential step in quantum information processing. In this work, we propose an efficient method to decompose symmetric multipartite observables, which are invariant under…
The Groverian entanglement measure introduced earlier for pure quantum states [O. Biham, M.A. Nielsen and T. Osborne, Phys. Rev. A 65, 062312 (2002)] is generalized to the case of mixed states, in a way that maintains its operational…
This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based…
We discuss a general physical mechanism for arbitrary control of the quantum states of multiple qubits in the symmetric Dicke subspace. The qubit-qubit coupling leads to unequal energy spacing in the symmetric Dicke subspace. This allows…
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of…
A general quantum search algorithm aims to evolve a quantum system from a known source state $|s\rangle$ to an unknown target state $|t\rangle$. It uses a diffusion operator $D_{s}$ having source state as one of its eigenstates and $I_{t}$,…
Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial…
Qudit Dicke states are higher-dimensional analogues of an important class of highly-entangled completely symmetric quantum states known as (qubit) Dicke states. A circuit for preparing arbitrary qudit Dicke states deterministically is…
We give a detailed account of an efficient search algorithm for the data pattern tomography proposed by J. Rehacek, D. Mogilevtsev, and Z. Hradil [Phys. Rev. Lett.~\textbf{105}, 010402 (2010)], where the quantum state of a system is…
The efficient and reliable verification of quantum states plays a crucial role in various quantum information processing tasks. We consider the task of verifying entangled states using one-way and two-way classical communication and…
We provide an adaptive learning algorithm for tomography of general quantum states. Our proposal is based on the simultaneous perturbation stochastic approximation algorithm and is applicable on mixed qudit states. The salient features of…
Employing efficient diagonalization techniques, we perform a detailed quantitative study of the regular and chaotic regions in phase space in the simplest non-integrable atom-field system, the Dicke model. A close correlation between the…
Motivated by a compelling need for time-efficient and robust schemes for quantum-state engineering in systems of neutral atoms in optical tweezers, we consider a ring-shaped array of qubits with nearest-neighbor Ising-type ($zz$) coupling…