Related papers: Entanglement Dynamics in 1D Quantum Cellular Autom…
While quantum simulation is one of the most promising applications of modern quantum devices, accessible simulation times are fundamentally limited by finite coherence times due to omnipresent noise. Based on the ideas of relational…
The spin states of single electrons in gate-defined quantum dots satisfy crucial requirements for a practical quantum computer. These include extremely long coherence times, high-fidelity quantum operation, and the ability to shuttle…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
Entanglement with single-particle states is advantageous in quantum technology because of their ability to encode and process information more securely than their multi-particle analogs. Threeway and nonlocal two-way entangled…
The dynamics of the pairwise entanglement in a qubit lattice in the presence of static imperfections exhibits different regimes. We show that there is a transition from a perturbative region, where the entanglement is stable against…
In this thesis we present new results relevant to two important problems in quantum information science: the development of a theory of entanglement and the exploration of the use of controlled quantum systems to the simulation of quantum…
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…
In this work we map NISQ-friendly implementations of the non-interacting QCA to a circuit Quantum Electrodynamics (cQED) hardware. We perform both noiseless and noisy simulations of the QCA one particle sector, namely the Quantum Walk, on…
Cellular Automata(CA) is a discrete computing model which provides simple, flexible and efficient platform for simulating complicated systems and performing complex computation based on the neighborhoods information. CA consists of two…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
Classical computation relies heavily on information manipulation. Each component of a hardware needs to communicate with others, and this is done by encoding information into strings of bits and application of logical operations. When…
Entanglement is the crucial ingredient of quantum many-body physics, and characterizing and quantifying entanglement in closed system dynamics of quantum simulators is an outstanding challenge in today's era of intermediate scale quantum…
Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal…
We propose an implementation for quantum logic and computing using trapped atomic spins of two different species, interacting via direct magnetic spin-spin interaction. In this scheme, the spins (electronic or nuclear) of distantly spaced…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
We consider a one-dimensional chain of many superconducting quantum interference devices (SQUIDs), serving as charge qubits. Each SQUID is coupled to its nearest neighbors through constant capacitances. We study the quantum logic operations…
We present evidence that operation of QCA (Quantum Cellular Automaton) cells with four dots is possible with an occupancy of 4N+2 electrons per cell (N being an integer). We show that interaction between cells can be described in terms of a…
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…