Related papers: Expressiveness of Commutative Quantum Circuits: A …
In this paper, I propose a realistic interpretation (RI) of quantum mechanics, that is, an interpretation according to which a particle follows a definite path in spacetime. The path is not deterministic but it is rather a random walk.…
We develop the Husimi map for visualizing quantum wavefunctions using coherent states as a measurement of the local phase space to produce a vector field related to the probability flux. Adapted from the Husimi projection, the Husimi map is…
We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach that is shown to allow for universal quantum computing. The variational quantum circuit consists of tunable…
We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic…
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…
We consider the problem of estimating quantum observables on a collection of qubits, given as a linear combination of Pauli operators, with shallow quantum circuits consisting of single-qubit rotations. We introduce estimators based on…
We calculate the propagator of a particle caught in a Paul trap and subject to the continuous quantum measurement of its position. The probabilities of the measurement outputs, the possible trajectories of the particle, are also found. This…
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…
We investigate quantum dynamics of a quantum walker on a finite bipartite non-Hermitian lattice, in which the particle can leak out with certain rate whenever it visits one of the two sublattices. Quantum walker initially located on one of…
Complex quantum trajectory approach, which arose from a modified de Broglie-Bohm interpretation of quantum mechanics, has attracted much attention in recent years. The exact complex trajectories for the Eckart potential barrier and the soft…
We consider the quantum centipede made of $N$ fermionic quantum walkers on the one-dimensional lattice interacting by means of the simplest of all hard-bound constraints: the distance between two consecutive fermions is either one or two…
We consider the quantum scattering from a random potential of strength $\lambda^{1/2}$ and with a support on the scale of the mean free path, which is of order $\lambda^{-1}$. On the basis of maximally crossed diagrams we provide a concise…
Quantum computers are a leading platform for the simulation of many-body physics. This task has been recently facilitated by the possibility to program directly the time-dependent pulses sent to the computer. Here, we use this feature to…
A quantum coherent capacitor subject to large amplitude pulse cycles can be made to emit or reabsorb an electron in each half cycle. Quantized currents with pulse cycles in the GHz range have been demonstrated experimentally. We develop a…
We show that several quantum circuit families can be simulated efficiently classically if it is promised that their output distribution is approximately sparse i.e. the distribution is close to one where only a polynomially small, a priori…
Parameterized quantum circuits (PQCs) are fundamental to quantum machine learning (QML), quantum optimization, and variational quantum algorithms (VQAs). The expressibility of PQCs is a measure that determines their capability to harness…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…