Related papers: Universal initial state preparation for first quan…
We present a technique for enhancing the estimation of quantum state properties by incorporating approximate prior knowledge about the quantum state of interest. This method involves performing randomized measurements on a quantum processor…
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…
The Schur transform, which block-diagonalizes the tensor representation $U^{\otimes n}$ of the unitary group $\mathbf{U}_d$ on $n$ qudits, is an important primitive in quantum information and theoretical physics. We give a generalization of…
We implement the first open-source quantum computing emulator that includes arithmetic operations, the quantum Fourier transform, and quantum phase estimation. The emulator provides significant savings in both temporal and spatial resources…
Quantum annealing is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. Quantum annealing in the transverse field Ising model, implemented on D-Wave…
Sample-based quantum diagonalization (SQD) is a hybrid quantum-classical algorithm for estimating ground-state energies in electronic-structure calculations. It uses a quantum processor as a sampler to construct a variational subspace, with…
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…
Reversing unitary operations is a key task in quantum computing and quantum control. In this work, we introduce and develop the framework of shadow unitary inversion, a relaxed variant of unitary inversion in which the goal is to reproduce…
The ability to prepare states for quantum chemistry is a promising feature of quantum computers, and efficient techniques for chemical state preparation is an active area of research. In this paper, we implement and investigate two methods…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
We analyse a n-dimensional Generalized Uncertainty Principle (GUP) quantization framework, characterized by a non-commutative nature of the configurational variables. First, we identify a set of states which are maximally localized only…
The questions we raise in this letter are as follows: What is the most general representation of a quantum state at a single point in time? Can we adapt the current formalisms to situations where the order of quantum operations is…
We propose a scheme for an exact efficient transformation of a tensor product state of many identically prepared qubits into a state of a logarithmically small number of qubits. Using a quadratic number of elementary quantum gates we…
We formalize the correspondence between quantum states and quantum operations isometrically, and harness its consequences. This correspondence was already implicit in the various proofs of the operator sum representation of Completely…
We study the problems of state preparation, ground state preparation and quantum state preparation. We propose an analytic approach to a stochastic quantum algorithm which prepares the ground state for $n$-qubit Hamiltonian that is…
Whereas quantum complexity theory has traditionally been concerned with problems arising from classical complexity theory (such as computing boolean functions), it also makes sense to study the complexity of inherently quantum operations…
We present the first complete optimization of quantum tomography, for states, POVMs, and various classes of transformations, for arbitrary prior ensemble and arbitrary representation, giving corresponding feasible experimental schemes.
Efficient measures to determine similarity of quantum states, such as the fidelity metric, have been widely studied. In this paper, we address the problem of defining a similarity measure for quantum operations that can be…
We develop a theoretical framework for $S_n$-equivariant convolutional quantum circuits with SU$(d)$-symmetry, building on and significantly generalizing Jordan's Permutational Quantum Computing (PQC) formalism based on Schur-Weyl duality…
We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure…