10 research outputs found
Predicting Non-linear Cellular Automata Quickly by Decomposing Them into Linear Ones
We show that a wide variety of non-linear cellular automata (CAs) can be
decomposed into a quasidirect product of linear ones. These CAs can be
predicted by parallel circuits of depth O(log^2 t) using gates with binary
inputs, or O(log t) depth if ``sum mod p'' gates with an unbounded number of
inputs are allowed. Thus these CAs can be predicted by (idealized) parallel
computers much faster than by explicit simulation, even though they are
non-linear.
This class includes any CA whose rule, when written as an algebra, is a
solvable group. We also show that CAs based on nilpotent groups can be
predicted in depth O(log t) or O(1) by circuits with binary or ``sum mod p''
gates respectively.
We use these techniques to give an efficient algorithm for a CA rule which,
like elementary CA rule 18, has diffusing defects that annihilate in pairs.
This can be used to predict the motion of defects in rule 18 in O(log^2 t)
parallel time
Pointers in Recursion: Exploring the Tropics
We translate the usual class of partial/primitive recursive functions to a pointer recursion framework, accessing actual input values via a pointer reading unit-cost function. These pointer recursive functions classes are proven equivalent to the usual partial/primitive recursive functions. Complexity-wise, this framework captures in a streamlined way most of the relevant sub-polynomial classes. Pointer recursion with the safe/normal tiering discipline of Bellantoni and Cook corresponds to polylogtime computation. We introduce a new, non-size increasing tiering discipline, called tropical tiering. Tropical tiering and pointer recursion, used with some of the most common recursion schemes, capture the classes logspace, logspace/polylogtime, ptime, and NC. Finally, in a fashion reminiscent of the safe recursive functions, tropical tiering is expressed directly in the syntax of the function algebras, yielding the tropical recursive function algebras
Quasi-Linear Cellular Automata
Simulating a cellular automaton (CA) for t time-steps into the future
requires t^2 serial computation steps or t parallel ones. However, certain CAs
based on an Abelian group, such as addition mod 2, are termed ``linear''
because they obey a principle of superposition. This allows them to be
predicted efficiently, in serial time O(t) or O(log t) in parallel.
In this paper, we generalize this by looking at CAs with a variety of
algebraic structures, including quasigroups, non-Abelian groups, Steiner
systems, and others. We show that in many cases, an efficient algorithm exists
even though these CAs are not linear in the previous sense; we term them
``quasilinear.'' We find examples which can be predicted in serial time
proportional to t, t log t, t log^2 t, and t^a for a < 2, and parallel time log
t, log t log log t and log^2 t.
We also discuss what algebraic properties are required or implied by the
existence of scaling relations and principles of superposition, and exhibit
several novel ``vector-valued'' CAs.Comment: 41 pages with figures, To appear in Physica
Recommended from our members
On the Combinatorial and Logical Complexities of Algebraic Structures
In this thesis, we investigate the combinatorial and logical complexities of several algebraic structures, including groups, quasigroups, certain families of strongly regular graphs, and relation algebras. In Chapter 3, we leverage the Weisfeiler–Leman algorithm for groups (Brachter & Schweitzer, LICS 2020) to improve the parallel complexity of isomorphism testing for several families of groups including (i) coprime extensions H ⋉ N where H is O(1)-generated and N is Abelian (c.f., Qiao, Sarma, & Tang, STACS 2011), (ii) direct product decompositions, and (iii) groups without Abelian normal subgroups (c.f., Babai, Codenotti, & Qiao, ICALP 2012). Furthermore, we show that the weaker count-free Weisfeiler–Leman algorithm is unable to even identify Abelian groups. As a consequence, we obtain that FO fails to capture all polynomial-time computable queries even on Abelian groups. Nonetheless, we leverage the count-free variant of Weisfeiler– Leman in tandem with bounded non-determinism and limited counting to obtain a new upper bound of β1MAC0 (FOLL) for isomorphism testing of Abelian groups. This improves upon the previous TC0 (FOLL) upper bound due to Chattopadhyay, Toran, & Wagner (ACM Trans. Comput. Theory, 2013).
Weisfeiler–Leman is equivalent to the first in a hierarchy of Ehrenfeucht–Fra¨ıss´e pebble games (Hella, Ann. Pur. Appl. Log., 1989). In Chapter 4, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht-Fra¨ıss´e bijective pebble game in Hella’s (Ann. Pure Appl. Log., 1989) hierarchy. This is a Spoiler-Duplicator game in which Spoiler can place up to two pebbles each round. While it trivially solves graph isomorphism, it may be nontrivial for finite groups, and other ternary relational structures. We first provide a novel generalization of Weisfeiler-Leman (WL) coloring, which we call 2-ary WL. We then show that the 2-ary WL is equivalent to the second Ehrenfeucht-Fra¨ıss´e bijective pebble game in Hella’s hierarchy.
Our main result is that, in the pebble game characterization, only O(1) pebbles and O(1) rounds are sufficient to identify all groups without Abelian normal subgroups. In particular, we show that within the first few rounds, Spoiler can force Duplicator to select an isomorphism between two such groups at each subsequent round. By Hella’s results (ibid.), this is equivalent to saying that these groups are identified by formulas in first-order logic with generalized 2-ary quantifiers, using only O(1) variables and O(1) quantifier depth.
In Chapter 5, we show that Graph Isomorphism (GI) is not AC0 -reducible to several problems, including the Latin Square Isotopy problem and isomorphism testing of several families of Steiner designs. As a corollary, we obtain that GI is not AC0 -reducible to isomorphism testing of Latin square graphs and strongly regular graphs arising from special cases of Steiner 2-designs. We accomplish this by showing that the generator-enumeration technique for each of these problems can be implemented in β2FOLL, which cannot compute Parity (Chattopadhyay, Tor´an, & Wagner, ibid.).
Finally, in Chapter 6, we shed new light on the spectrum of the relation algebra we call An, which is obtained by splitting the non-flexible diversity atom of 67 into n symmetric atoms. Precisely, we show that the minimum value in Spec(An) is at most 2n6+o(1), which is the first polynomial bound and improves upon the previous bound due to Dodd & Hirsch (J. Relat. Methods Comput. Sci. 2013). We also improve the lower bound to 2n2 + Ω(n√logn). Prior to the work in this thesis, only the trivial bound of n2 + 2n + 3 was known.</p
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
Ancillas in Quantum Computation: Beyond Two-Level Systems
Quantum computers have the potential to solve problems that are believed to be classically intractable. However, building such a device is proving to be very challenging. In this thesis, two physically promising settings for quantum computation are investigated: the one-way quantum computer and ancilla-based quantum gates. The majority of both the theoretical and experimental focus in the field of quantum computation has been on computation using 2-level quantum systems, known as qubits. In contrast to this, in this thesis I consider the relatively less well-understood setting of quantum computation using continuous variables or d-level quantum systems, called qudits. I develop a simple notation that encompasses each different encoding, and is applicable to a `general quantum variable'. These ideas are then used to investigate computational depth (a proxy for time) in quantum circuits and one-way quantum computations in this general quantum variable setting. In doing so, the parallelism inherent in the one-way quantum computer is made precise. In the second half of this thesis, a range of techniques are proposed for implementing entangling gates on a well-isolated computational register via interactions with `ancillary' systems. In particular, ancilla-based quantum gates for general quantum variables are investigated - including the interesting case of hybrid quantum computation, whereby more than one encoding is used in tandem. The methods proposed herein each have their own unique advantages, such as: reducing gate-counts in certain circuits, allowing for inherently parallel computation, or minimising the physical requirements for universal quantum computation. In particular, the final gate techniques that are proposed in this thesis may implement any quantum computation using only a single fixed ancilla-register interaction gate and ancillas prepared in simple states. This then allows the computational register to consist of well-isolated `memory' quantum variables and the ancillas need only be optimised for a single high-quality fixed interaction gate. Hence, this provides a simple and highly promising setting for physically implementing a quantum computer
Collected Papers (on Neutrosophics, Plithogenics, Hypersoft Set, Hypergraphs, and other topics), Volume X
This tenth volume of Collected Papers includes 86 papers in English and Spanish languages comprising 972 pages, written between 2014-2022 by the author alone or in collaboration with the following 105 co-authors (alphabetically ordered) from 26 countries: Abu Sufian, Ali Hassan, Ali Safaa Sadiq, Anirudha Ghosh, Assia Bakali, Atiqe Ur Rahman, Laura Bogdan, Willem K.M. Brauers, Erick González Caballero, Fausto Cavallaro, Gavrilă Calefariu, T. Chalapathi, Victor Christianto, Mihaela Colhon, Sergiu Boris Cononovici, Mamoni Dhar, Irfan Deli, Rebeca Escobar-Jara, Alexandru Gal, N. Gandotra, Sudipta Gayen, Vassilis C. Gerogiannis, Noel Batista Hernández, Hongnian Yu, Hongbo Wang, Mihaiela Iliescu, F. Nirmala Irudayam, Sripati Jha, Darjan Karabašević, T. Katican, Bakhtawar Ali Khan, Hina Khan, Volodymyr Krasnoholovets, R. Kiran Kumar, Manoranjan Kumar Singh, Ranjan Kumar, M. Lathamaheswari, Yasar Mahmood, Nivetha Martin, Adrian Mărgean, Octavian Melinte, Mingcong Deng, Marcel Migdalovici, Monika Moga, Sana Moin, Mohamed Abdel-Basset, Mohamed Elhoseny, Rehab Mohamed, Mohamed Talea, Kalyan Mondal, Muhammad Aslam, Muhammad Aslam Malik, Muhammad Ihsan, Muhammad Naveed Jafar, Muhammad Rayees Ahmad, Muhammad Saeed, Muhammad Saqlain, Muhammad Shabir, Mujahid Abbas, Mumtaz Ali, Radu I. Munteanu, Ghulam Murtaza, Munazza Naz, Tahsin Oner, Gabrijela Popović, Surapati Pramanik, R. Priya, S.P. Priyadharshini, Midha Qayyum, Quang-Thinh Bui, Shazia Rana, Akbara Rezaei, Jesús Estupiñán Ricardo, Rıdvan Sahin, Saeeda Mirvakili, Said Broumi, A. A. Salama, Flavius Aurelian Sârbu, Ganeshsree Selvachandran, Javid Shabbir, Shio Gai Quek, Son Hoang Le, Florentin Smarandache, Dragiša Stanujkić, S. Sudha, Taha Yasin Ozturk, Zaigham Tahir, The Houw Iong, Ayse Topal, Alptekin Ulutaș, Maikel Yelandi Leyva Vázquez, Rizha Vitania, Luige Vlădăreanu, Victor Vlădăreanu, Ștefan Vlăduțescu, J. Vimala, Dan Valeriu Voinea, Adem Yolcu, Yongfei Feng, Abd El-Nasser H. Zaied, Edmundas Kazimieras Zavadskas.