Related papers: Preparing angular momentum eigenstates using engin…
Several quantum many-body models in one dimension possess exact solutions via the Bethe ansatz method, which has been highly successful for understanding their behavior. Nevertheless, there remain physical properties of such models for…
In the past few years there has been a tumultuous activity aimed at introducing novel conceptual schemes for quantum computing. The approach proposed in (Marzuoli A and Rasetti M 2002, 2005a) relies on the (re)coupling theory of SU(2)…
We investigate the properties of a quantum walk which can simulate the behavior of a spin $1/2$ particle in a model with an ordinary spatial dimension, and one extra dimension with warped geometry between two branes. Such a setup…
Many quantum algorithms rely on a quality initial state for optimal performance. Preparing an initial state for specific applications can considerably reduce the cost of probabilistic algorithms such as the well studied quantum phase…
In recent times, hybrid-entanglement (HE) between a qubit and a coherent state has demonstrated superior performance in various quantum information processing tasks, particularly in quantum key distribution. Despite its theoretical…
Entangled resources enable quantum sensing that achieves Heisenberg scaling, a quadratic improvement on the standard quantum limit, but preparing large scale entangled states is challenging in the presence of decoherence. We present a…
Cat states are coherent quantum superpositions of macroscopically distinct states and are useful for understanding the boundary between the classical and the quantum world. Due to their macroscopic nature, cat states are difficult to…
We experimentally demonstrate the transfer of an unknown single-qubit state from Alice to Bob via a two-step discrete-time quantum random walk on a cycle with four vertices on a four-qubit nuclear magnetic resonance quantum processor. The…
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these…
The dynamical preparation of exotic many-body quantum states is a persistent goal of analog quantum simulation, often limited by experimental coherence times. Recently, it was shown that fast, non-adiabatic Hamiltonian parameter sweeps can…
Efficiently calculating the low-lying eigenvalues of Hamiltonians, written as sums of Pauli operators, is a fundamental challenge in quantum computing. While various methods have been proposed to reduce the complexity of quantum circuits…
The preparation of Hamiltonian eigenstates is essential for many applications in quantum computing; the efficiency with which this can be done is of key interest. A canonical approach exploits the quantum phase estimation (QPE) algorithm.…
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state…
Quantum teleportation is one of the most important techniques for quantum information secure transmission. Using preshared entanglement, quantum teleportation is designed as a basic key in many quantum information tasks and features…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…
We analyze the strengths and limitations of steered discrete time quantum walks in generating quantum states of bipartite quantum systems comprising of a qubit coupled to a qudit system. We demonstrate that not all quantum states in the…
For quantum computation using photons, performing deterministic quantum gate operations is a challenge due to the probabilistic nature of the photon-photon interaction. Encoding qubits in multiple degrees-of-freedom of photons and…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…