Related papers: Universal initial state preparation for first quan…
Continuous measurement of quantum systems provides a standard route to quantum trajectories through the successive acquisition of information which further results in measurement back-action. In this work, we harness this back-action as a…
Motivated by recent quantum gas microscope experiments for fermions in optical lattices, we present proof of principle calculations showing that it is possible to obtain the complete information about the quantum state on a small subsystem…
Quantum computing draws huge attention due to its faster computational capability compared to classical computing to represent and compress the classical image data into the quantum domain. The main idea of quantum domain representation is…
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…
Dissipative engineering is a powerful tool for quantum state preparation, and has drawn significant attention in quantum algorithms and quantum many-body physics in recent years. In this work, we introduce a novel approach using the…
Universal quantum computation using photonic systems requires gates whose Hamiltonians are of order greater than quadratic in the quadrature operators. We first review previous proposals to implement such gates, where specific non-Gaussian…
Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families of states. This work introduces a method for preparing…
Quantum tomography is a process of quantum state reconstruction using data from multiple measurements. An essential goal for a quantum tomography algorithm is to find measurements that will maximize the useful information about an unknown…
Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. First we show that approximating an element of the inverse of…
The quantum states representing classical phase space are given, and these are used to formulate quantum statistical mechanics as a formally exact double perturbation expansion about classical statistical mechanics. One series of quantum…
Resource theory of imaginarity provides a useful framework to understand the role of complex numbers, which are essential in the formulation of quantum mechanics, in a mathematically rigorous way. In the first part of this article, we study…
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For…
Control strategies for dissipative preparation of target quantum states, both pure and mixed, and subspaces are obtained by switching between a set of available semigroup generators. We show that the class of problems of interest can be…
Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained…
For quantum computation, we investigate the conjecture that the superposition of macroscopically distinct states is necessary for a large quantum speedup. Although this conjecture was supported for a circuit-based quantum computer…
It is shown how it is possible to reconstruct the initial state of a one-dimensional system by measuring sequentially two conjugate variables. The procedure relies on the quasi-characteristic function, the Fourier-transform of the Wigner…
Quantum state tomography (QST) for reconstructing pure states requires exponentially increasing resources and measurements with the number of qubits by using state-of-the-art quantum compressive sensing (CS) methods. In this article, QST…
Quantum computers will be able solve important problems with significant polynomial and exponential speedups over their classical counterparts, for instance in option pricing in finance, and in real-space molecular chemistry simulations.…
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…