English
Related papers

Related papers: Note on quantum cellular automata and strong equiv…

200 papers

Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…

Quantum Physics · Physics 2025-07-28 Thiago L. M. Guedes , Don Winter , Markus Müller

We study matrix product unitary operators (MPUs) for fermionic one-dimensional (1D) chains. In stark contrast with the case of 1D qudit systems, we show that (i) fermionic MPUs do not necessarily feature a strict causal cone and (ii) not…

Statistical Mechanics · Physics 2021-01-15 Lorenzo Piroli , Alex Turzillo , Sujeet K. Shukla , J. Ignacio Cirac

Quantum cellular automata (QCA) are discrete models of space and time homogeneous quantum field theories (QFTs) and regarded as natural candidates for quantum simulation. Description of a QCA over the separable Hilbert space of finite,…

Quantum Physics · Physics 2019-07-23 Asif Shakeel

We study two-dimensional rotation-symmetric number-conserving cellular automata working on the von Neumann neighborhood (RNCA). It is known that such automata with 4 states or less are trivial, so we investigate the possible rules with 5…

Formal Languages and Automata Theory · Computer Science 2016-10-04 Katsunobu Imai , Hisamichi Ishizaka , Victor Poupet

In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata by A.Kondacs and J.Watrous. The well-formedness conditions for…

Quantum Physics · Physics 2007-05-23 Maksim Kravtsev

Control over spin dynamics has been obtained in NMR via coherent averaging, which is implemented through a sequence of RF pulses, and via quantum codes which can protect against incoherent evolution. Here, we discuss the design and…

Quantum Physics · Physics 2009-11-06 Yehuda Sharf , Timothy F. Havel , David G. Cory

We consider simulating the BCS Hamiltonian, a model of low temperature superconductivity, on a quantum computer. In particular we consider conducting the simulation on the qubus quantum computer, which uses a continuous variable ancilla to…

Quantum Physics · Physics 2011-11-08 Katherine L. Brown , Suvabrata De , Vivien M. Kendon , William J. Munro

This study presents a unitary quantum cellular automaton (QCA) that, in the continuum limit, converges to the (1+1)-dimensional Generalized Dirac Equation (GDE). We outline the construction of the unitary, discrete-time evolution and derive…

Quantum Physics · Physics 2025-10-03 Xingyou Song

We introduce and describe a class of simple facilitated quantum spin models in which the dynamics is due to the repeated application of unitary gates. The gates are applied periodically in time, so their combined action constitutes a…

Statistical Mechanics · Physics 2018-02-23 Sarang Gopalakrishnan , Bahti Zakirov

We systematically study categorical duality operators on spin (and anyon) chains with respect to an internal fusion category symmetry C. We parameterize duality operators on the quasi-local algebra in terms of data dependent on the…

Quantum Algebra · Mathematics 2026-03-30 Corey Jones , Xinping Yang

Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A.…

Quantum Physics · Physics 2007-05-23 M. V. Panduranga Rao , V. Vinay

Quantum-dot Cellular Automata (QCA) is one of the emerging nanotechnologies, promising alternative to CMOS technology due to faster speed, smaller size, lower power consumption, higher scale integration and higher switching frequency. Also,…

Emerging Technologies · Computer Science 2019-07-24 Moein Sarvaghad-Moghaddam , Ali A. Orouji

Effective spin-spin interactions between N+1 qubits enable the determination of the eigenvalue of an arbitrary Pauli product of dimension N with a constant, small number of multi-qubit gates that is independent of N and encodes the…

Quantum Physics · Physics 2018-04-04 D. Leibfried , D. J. Wineland

In this work, we develop a method to use Quantum- Dot Cellular Automata (QCA) for universal quantum computing. This method is based conceptually on refocusing in NMR systems. We show how an array of QCA cells can be used for isolated single…

Quantum Physics · Physics 2024-05-28 Seyed Arash Sheikholeslam , Konrad Walus

For linear non-uniform cellular automata (NUCA) which are local perturbations of linear CA over a group universe $G$ and a finite-dimensional vector space alphabet $V$ over an arbitrary field $k$, we investigate their Dedekind finiteness…

Dynamical Systems · Mathematics 2024-11-20 Xuan Kien Phung

A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…

Quantum Physics · Physics 2017-06-06 Hans-Thomas Elze

In the literature, there exist several quantum finite automata (QFA) models with both quantum and classical states. These models are of particular interest,as they show praiseworthy advantages over the fully quantum models in some…

Formal Languages and Automata Theory · Computer Science 2015-06-30 Lvzhou Li , Yuan Feng

We consider symmetry-protected topological (SPT) phases in 2D protected by linear subsystem symmetries, i.e. those that act along rigid lines. There is a distinction between a "strong" subsystem SPT phase, and a "weak" one, which is…

Strongly Correlated Electrons · Physics 2018-12-19 Trithep Devakul , Dominic J. Williamson , Yizhi You

Models of universal quantum computation in which the required interactions between register (computational) qubits are mediated by some ancillary system are highly relevant to experimental realisations of a quantum computer. We introduce…

Quantum Physics · Physics 2015-04-09 Timothy J. Proctor , Shane Dooley , Viv Kendon

We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-way nondeterministic finite automata (2NFA's). For this…

Computational Complexity · Computer Science 2014-01-29 Abuzer Yakaryilmaz , A. C. Cem Say