Related papers: Mapping of Quantum Systems to the Probability Simp…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We propose a theoretical protocol for reconstructing the density matrix of a single-electron spin qubit using spin-polarized transport. The system consists of a quantum dot coupled to ferromagnetic reservoirs and subject to a magnetic field…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
The typicality approach and the Hilbert space averaging method as its technical manifestation are important concepts of quantum statistical mechanics. Extensively used for expectation values we extend them in this paper to transition…
We prove that the Hilbert space description of all joint von Neumann measurements on a quantum state can be reproduced in terms of a single measure space ({\Omega}, F, {\mu}) with a normalized real-valued measure {\mu}, that is, in terms of…
We propose a solvable model of Quantum Darwinism to encoding transitions -- abrupt changes in how quantum information spreads in a many-body system under unitary dynamics. We consider a random Clifford circuit on an expanding tree, whose…
Quantum computing is greatly advanced in recent years and is expected to transform the computation paradigm in the near future. Quantum circuit simulation plays a key role in the toolchain for the development of quantum hardware and…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…
Predictions for measurement outcomes in physical theories are usually computed by combining two distinct notions: a state, describing the physical system, and an observable, describing the measurement which is performed. In quantum theory,…
We have studied quantum systems on finite-dimensional Hilbert spaces and found that all these systems are connected through local transformations. Actually, we have shown that these transformations give rise to a gauge group that connects…
We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase…
Focusing particularly on one-qubit and two-qubit systems, I explain how the quantum state of a system of n qubits can be expressed as a real function--a generalized Wigner function--on a discrete 2^n x 2^n phase space. The phase space is…
Quantum state transfer and teleportation, with qubits encoded in internal states of the atoms in cavities, among spatially separated nodes of a quantum network in decoherence-free subspace are proposed, based on a cavity-assisted…
In order to resolve the measurement problem of Quantum Mechanics, non-unitary time evolution has been derived from the unitarity of standard quantum formalism. New wave functions of free and non-free quantum systems follow from Schroedinger…
We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first…
I explore the possibility that a quantum system S may be described completely by the combination of its standard quantum state $|\psi\rangle$ and a (hidden) quantum state $|\phi\rangle$ (that lives in the same Hilbert space), such that the…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
Comparing probability distributions is a core challenge across the natural, social, and computational sciences. Existing methods, such as Maximum Mean Discrepancy (MMD), struggle in high-dimensional and non-compact domains. Here we…
As time passes, once simple quantum states tend to become more complex. For strongly coupled k-local Hamiltonians, this growth of computational complexity has been conjectured to follow a distinctive and universal pattern. In this paper we…