Related papers: Operator dynamics in k-Markov random circuits
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example…
Reservoir computing is a framework which is primarily used for temporal information processing, using the intrinsic dynamics of an underlying physical system. The framework, in a quantum setup, is implemented using ergodic dynamics…
Recently introduced dual unitary brickwork circuits have been recognised as paradigmatic exactly solvable quantum chaotic many-body systems with tunable degree of ergodicity and mixing. Here we show that regularity of the circuit lattice is…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood…
We introduce a new family of quantum circuits for which the scrambling of a subspace of non-local operators is classically simulable. We call these circuits `super-Clifford circuits', since the Heisenberg time evolution of these operators…
Many-body quantum dynamics defined on a spatial lattice and in discrete time -- either as stroboscopic Floquet systems or quantum circuits -- has been an active area of research for several years. Being discrete in space and time, a natural…
Surface acoustic waves (SAWs) can create moving quantum dots in piezoelectric materials. Here we show how electron-spin qubits located on dynamic quantum dots can be entangled. Previous theoretical and numerical models of quantum-dot…
Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
Unitary $k$-designs are probabilistic ensembles of unitary matrices whose first $k$ statistical moments match that of the full unitary group endowed with the Haar measure. In prior work, we showed that the automorphism group of classical…
We use quantum optimal control to identify fast collision-based two-qubit $\sqrt{\text{SWAP}}$ gates in ultracold atoms. We show that a significant speed up can be achieved by optimizing the full gate instead of separately optimizing the…
The authors report on modeling of transport spectroscopy in split-gate controlled quantum constrictions. A mixed momentum-coordinate representation is employed to solve a set of time-dependent Lippmann-Schwinger equations with intricate…
We map electron spin dynamics from time to space in quantum wires with spatially uniform and oscillating Rashba spin-orbit coupling. The presence of the spin-orbit interaction introduces pseudo-Zeeman couplings of the electron spins to…
We study operator scrambling in quantum circuits built from `super-Clifford' gates. For such circuits it was established in arXiv:2002.12824 that the time evolution of operator entanglement for a large class of many-body operators can be…
Swap mapping is a quantum compiler optimization that, by introducing SWAP gates, maps a logical quantum circuit to an equivalent physically implementable one. The physical implementability of a circuit is determined by the fulfillment of…
A system of diagrams is introduced that allows the representation of various elements of a quantum circuit, including measurements, in a form which makes no reference to time (hence ``atemporal''). It can be used to relate quantum dynamical…
We report the first experimental realization of single-qubit manipulation for single spinwaves stored in an atomic ensemble quantum memory. In order to have high-fidelity gate operations, we make use of stimulated Raman transition and…
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from (a x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of…