Quantum computation via translation-invariant operations on a chain of qubits

Abstract

A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are translation-invariant.

Comment after Eq. (2) inserted, journal version

References in corpus (3)

• Mirror Inversion of Quantum States in Linear Registers
• Ensemble Quantum Computation with atoms in periodic potentials
• A relational quantum computer using only two-qubit total spin measurement and an initial supply of highly mixed single qubit states

Cited by in corpus (41)

• Quantum Communication through Spin Chain Dynamics: an Introductory Overview
• Entropy scaling and simulability by Matrix Product States
• Spin-Based Quantum Computers made by Chemistry: Hows and Whys
• Quantum Computing with NMR
• Large gradients via correlation in random parameterized quantum circuits
• A review of Quantum Cellular Automata
• Globally controlled quantum wires for perfect qubit transport, mirroring and computing
• On entropy growth and the hardness of simulating time evolution
• Local controllability of quantum networks
• Architectures for quantum simulation showing a quantum speedup
• A computationally universal phase of quantum matter
• Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
• Decoherence effects on the quantum spin channels
• Quantum state transfer and time-dependent disorder in Quantum Chains
• Time Asymptotics and Entanglement Generation of Clifford Quantum Cellular Automata
• Quantum Information Processing with Delocalized Qubits under Global Control
• A Processor Core Model for Quantum Computing
• Quantum switching networks for perfect qubit routing
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits
• The Computational Power of Symmetric Hamiltonians
• Detecting subsystem symmetry protected topological order via entanglement entropy
• Entanglement Generation of Clifford Quantum Cellular Automata
• Advantages and limitations of quantum routing
• Always On Non-Nearest-Neighbor Coupling in Scalable Quantum Computing
• Quantum routing with fast reversals
• Low Depth Quantum Circuits for Ising Models
• Local Operations in qubit arrays via global but periodic Manipulation
• Fidelity, entanglement, and information complementarity relation
• Quantum information processing in a spin-bus system of coupled chains
• Quantum Complexity: restrictions on algorithms and architectures
• Variational measurement-based quantum computation for generative modeling
• Globally controlled universal quantum computation with arbitrary subsystem dimension
• Nearly optimal time-independent reversal of a spin chain
• Measurement-based quantum computation from Clifford quantum cellular automata
• Many-body quantum catalysts for transforming between phases of matter
• Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings
• Building globally controlled quantum processors with ZZ interactions
• Low overhead universality and quantum supremacy using only $Z$-control
• Blind quantum computing with different qudit resource state architectures
• Realization of Surface Code Quantum Memory on Systems with Always-On Interactions