Classification of qubit cellular automata on hypercubic lattices

• URL: http://arxiv.org/abs/2408.04493v1
• Date: Thu, 8 Aug 2024 14:42:39 GMT
• Title: Classification of qubit cellular automata on hypercubic lattices
• Authors: Andrea Pizzamiglio, Alessandro Bisio, Paolo Perinotti,
• Abstract summary: We classify qubit QCAs on lattices $mathbb Zs$ with von Neumann neighbourhood scheme, in terms of feasibility as finite depth quantum circuits. We show the most general structure of such quantum circuit and use its characterisation to simulate a few steps of evolution and evaluate the rate of entanglement production between one cell and its surroundings.
• Score: 45.279573215172285
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We classify qubit QCAs on lattices $\mathbb Z^s$ with von Neumann neighbourhood scheme, in terms of feasibility as finite depth quantum circuits. We show the most general structure of such quantum circuit and use its characterisation to simulate a few steps of evolution and evaluate the rate of entanglement production between one cell and its surroundings.

Related papers

• Quantum Machine Learning in Multi-Qubit Phase-Space Part I: Foundations [0.6116681488656472]
  We construct a closed, composable dynamical formalism for one- and many-qubit systems in phase-space.<n>It recasts the curse of dimensionality in terms of harmonic support on a domain that scales linearly with the number of qubits.
  arXiv  Detail & Related papers  (2025-07-16T10:37:16Z)
• Fermionic cellular automata in one dimension [72.49909271232748]
  We consider quantum cellular automata for one-dimensional chains of Fermionic modes. A complete characterization of nearest-neighbours automata is given.
  arXiv  Detail & Related papers  (2025-01-09T16:22:15Z)
• Renormalisation of Quantum Cellular Automata [45.279573215172285]
  We study a coarse-graining procedure for quantum cellular automata on hypercubic lattices.<n>Multiple evolution steps applied to a subspace in each tile can be viewed as a single evolution step of a new quantum cellular automaton.<n>We derive a necessary and sufficient condition for renormalizability and use it to investigate the renormalization flow of cellular automata on a line.
  arXiv  Detail & Related papers  (2024-07-17T15:33:33Z)
• Quantum collision circuit, quantum invariants and quantum phase estimation procedure for fluid dynamic lattice gas automata [0.0]
  We develop a quantum algorithm that allows for the simulation of fluid dynamic LGCA on a quantum computer. We also develop a phase estimation procedure for detecting quantities of interest such as mass and momentum, avoiding reinitialization of the cell.
  arXiv  Detail & Related papers  (2023-10-11T10:22:07Z)
• Systematic Computation of Braid Generator Matrix in Topological Quantum Computing [0.0]
  We present a systematic numerical method to compute the elementary braiding operations for topological quantum computation (TQC) Braiding non-Abelian anyons is a crucial technique in TQC, offering a topologically protected implementation of quantum gates. We provide a proof of concept by successfully reproducing the CNOT gate.
  arXiv  Detail & Related papers  (2023-07-04T19:33:17Z)
• Modular Cluster Circuits for the Variational Quantum Eigensolver [0.0]
  In the present work, we introduce a modular 2-qubit cluster circuit that allows for the design of a shallow-depth quantum circuit. The design was tested on the H2, (H2) and LiH molecules, as well as the finite-size transverse-field Ising model.
  arXiv  Detail & Related papers  (2023-05-08T02:33:33Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Three-fold way of entanglement dynamics in monitored quantum circuits [68.8204255655161]
  We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles. We obtain insights into the interplay between the local entanglement generation by the gates and the entanglement reduction by the measurements.
  arXiv  Detail & Related papers  (2022-01-28T17:21:15Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Towards self-organized control: Using neural cellular automata to robustly control a cart-pole agent [62.997667081978825]
  We use neural cellular automata to control a cart-pole agent. We trained the model using deep-Q learning, where the states of the output cells were used as the Q-value estimates to be optimized.
  arXiv  Detail & Related papers  (2021-06-29T10:49:42Z)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)
• Directed percolation in non-unitary quantum cellular automata [0.0]
  We construct a non-unitary Quantum Cellular Automaton that generalises the Domany-Kinzel cellular automaton. We study the resulting dynamical evolution using the numerical simulations using the tensor network iTEBD algorithm.
  arXiv  Detail & Related papers  (2021-05-04T10:10:16Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Quantum-to-classical transition via quantum cellular automata [0.0]
  A quantum cellular automaton (QCA) is an abstract model consisting of an array of finite-dimensional quantum systems. We show that the emergent-effective result of the former microscopic discrete model converges to the diffusion equation and to a classical transport equation.
  arXiv  Detail & Related papers  (2020-12-08T06:09:39Z)
• Coarse-grained quantum cellular automata [0.0]
  We provide a simple procedure to coarse-grain color-blind quantum cellular automata that follow Goldilocks rules. A byproduct of this simple toy-model is a general discrete analog of the Stokes law. The QCA we introduce here can be implemented by present-day quantum platforms, such as Rydberg arrays, trapped ions, and superconducting qbits.
  arXiv  Detail & Related papers  (2020-11-09T09:56:16Z)
• Variational Quantum Simulation for Periodic Materials [0.0]
  We present a quantum-classical hybrid algorithm that simulates electronic structures of periodic systems such as ground states and quasiparticle band structures. Our work establishes a powerful interface between the rapidly developing quantum technology and modern material science.
  arXiv  Detail & Related papers  (2020-08-21T14:15:28Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.