Related papers: Constructing General Unitary Maps from State Prepa…
We construct examples of highly entangled two-dimensional states by exploiting a correspondence between stochastic processes in $d$ dimensions and quantum states in $d+1$ dimensions. The entanglement structure of these states, which we…
We consider the problem of preparing topologically ordered states using unitary and non-unitary circuits, as well as local time-dependent Hamiltonian and Liouvillian evolutions. We prove that for any topological code in $D$ dimensions, the…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be…
We propose an interferometric method for statistically discriminating between nonorthogonal states in high dimensional Hilbert spaces for use in quantum information processing. The method is illustrated for the case of photon orbital…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
Since the final quantum state in the Grover search algorithm is the normalized marked quantum state from the Gram-Schmidt process, Abrams and Lloyd [1] has shown that we can generate this vector by using a non-unitary gate. Following their…
We propose a simpler and more efficient scheme for the implementation of the multi-valued Grover's quantum search. The multi-valued search generalizes the original Grover's search by replacing qubits with qudits --- quantum systems of $d$…
We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over…
We present a tensor-structured algorithm for efficient large-scale DFT calculations by constructing a Tucker tensor basis that is adapted to the Kohn-Sham Hamiltonian and localized in real-space. The proposed approach uses an additive…
Reconstructing a quantum system's Hamiltonian from limited yet experimentally observable information is interesting both as a practical task and from a fundamental standpoint. We pose and investigate the inverse problem of reconstructing a…
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and…
A general scheme is presented to decompose a $d$-by-$d$ unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level…
The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the…
This paper presents a hybrid variational quantum algorithm that finds a random eigenvector of a unitary matrix with a known quantum circuit. The algorithm is based on the SWAP test on trial states generated by a parametrized quantum…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
The construction of the Hamiltonian matrix \textbf{H} is an essential, yet computationally expensive step in \textit{ab-initio} device simulations based on density-functional theory (DFT). In homogeneous structures, the fact that a unit…
Solutions of generic $SU(2)\otimes SU(2)$ Hamiltonian eigensystems are obtained through systematic manipulations of quartic polynomial equations. An {\em ansatz} for constructing separable and entangled eigenstate basis, depending on the…
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…
Long-range entanglement--the backbone of topologically ordered states--cannot be created in finite time using local unitary circuits, or equivalently, adiabatic state preparation. Recently it has come to light that single-site measurements…