Related papers: Constructing General Unitary Maps from State Prepa…
We study the problem of constructing strong approximate unitary $k$-designs on $D$-dimensional grids (and more generally on Cartesian products of graphs), building on the work of Schuster et al. arXiv:2509.26310 which establishes strong…
We present a theoretical proposal for the implementation of geometric quantum computing based on a Hamiltonian which has a doubly degenerate ground state. Thus the system which is steered adiabatically, remains in the ground-state. The…
Rapid sampling from the environment to acquire available frontier points and timely incorporating them into subsequent planning to reduce fragmented regions are critical to improve the efficiency of autonomous exploration. We propose HPHS,…
We present a quantum algorithm for simulating complex many-body systems and finding their ground states, combining the use of tensor networks and density matrix renormalization group (DMRG) techniques. The algorithm is based on von…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
A mapping technique is used to derive in the context of constituent quark models effective Hamiltonians that involve explicit hadron degrees of freedom. The technique is based on the ideas of mapping between physical and ideal Fock spaces…
It has been shown that, starting from the state |0>, in the general case, an arbitrary quantum state |\psi> cannot be prepared with exponential precision in polynomial time. However, we show that for the important special case when |\psi>…
A primary objective of quantum computation is to efficiently simulate quantum physics. Scientifically and technologically important quantum Hamiltonians include those with spin-$s$, vibrational, photonic, and other bosonic degrees of…
Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum…
Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given…
Linear combination of unitaries (LCU for short) is one of the most important techniques in designing quantum algorithms. In this paper, we propose a new quantum algorithm in three different forms to achieve LCU. Different from previous…
We establish a direct connection between the power of a unitary map in $d$-dimensions ($d<\infty$) to generate quantum coherence and the geometry of the set ${\cal M}_d$ of maximally abelian subalgebras (of the quantum system full operator…
We propose a feasible scheme to achieve quantum computation based on geometric manipulation of ensembles of atoms, and analyze it for neutral rubidium atoms magnetically trapped in planoconcave microcavities on an atom chip. The geometric…
We present a novel method for predicting binary phase diagrams through the automatic construction of a minimal basis set of representative templates. The core assumption is that any materials space can be divided into a small number of…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
Accurately and globally mapping human infrastructure is an important and challenging task with applications in routing, regulation compliance monitoring, and natural disaster response management etc.. In this paper we present progress in…
Graph states are an important class of multipartite entangled states. Previous experimental generation of graph states and in particular the Greenberger-Horne-Zeilinger (GHZ) states in linear optics quantum information schemes is subjected…