Related papers: Preparing angular momentum eigenstates using engin…
The Stern-Gerlach experiment has played a central role in the discovery of spin angular momentum. It can also play a pivotal role in teaching the formalism of quantum mechanics using a concrete example involving a finite-dimensional Hilbert…
Although quantum walks exhibit peculiar properties that distinguish them from random walks, classical behavior can be recovered in the asymptotic limit by destroying the coherence of the pure state associated to the quantum system. Here I…
We propose an experimentally accessible procedure for conditional preparation of highly non-classical states of collective spin of an atomic ensemble. The quantum state engineering is based on a combination of QND interaction between atoms…
One of the major components for realizing quantum computers is the ability to initialize the computer to a known fiducial state, also known as state preparation. We demonstrate a state preparation method via measurement-induced steering on…
Quantum dynamics can be analyzed via the structure of energy eigenstates. However, in the many-body setting, preparing eigenstates associated with finite temperatures requires time scaling exponentially with system size. In this work we…
Quantum Rings have been simulated so far in many ways, but in this work a new aproximation is deemed. We use particles without angular momentum and several spectra, for different geometric settings, are gotten. These spectra depends on K,…
We propose applying the adiabatic algorithm to prepare high-energy eigenstates of integrable models on a quantum computer. We first review the standard adiabatic algorithm to prepare ground states in each magnetization sector of the…
The class of two-qubit Bell-diagonal states has been the workhorse for developing understanding about the geometry, dynamics, and applications of quantum resources. In this article, we present a quantum circuit for preparing Bell-diagonal…
We propose a Hamiltonian-based quantum state preparation method implemented via a shallow parametrized quantum circuit. The approach learns the parameters of a diagonal Hamiltonian through a classical training phase, while the quantum…
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…
This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum…
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be…
The Coupled Cluster (CC) method is used to compute the electronic correlation energy in atoms and molecules and often leads to highly accurate results. However, due to its single-reference nature, standard CC in its projected form fails to…
The combined Continuous Time Random Walk (CTRW) in position and momentum space is introduced, in the form of two coupled integral equations that describe the evolution of the probability distribution for finding a particle at a certain…
We consider a spectral analysis on the quantum walks on graph $G=(V,E)$ with the local coin operators $\{C_u\}_{u\in V}$ and the flip flop shift. The quantum coin operators have commonly two distinct eigenvalues $\kappa,\kappa'$ and…
Traditional computational methods for studying quantum many-body systems are "forward methods," which take quantum models, i.e., Hamiltonians, as input and produce ground states as output. However, such forward methods often limit one's…
Discrete-time quantum walks (QWs) represent robust and versatile platforms for the controlled engineering of single particle quantum dynamics, and have attracted special attention due to their algorithmic applications in quantum information…
Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
Quantum computers have the opportunity to be transformative for a variety of computational tasks. Recently, there have been proposals to use the unsimulatably of large quantum devices to perform regression, classification, and other machine…