Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Quantum Information

Nonlocal quantum computing theory and Poincare cycle in spherical states

C. H. Wu, Andrew Van Horn

Published Aug 1, 2021• 0 citations
Publisher

Abstract

Four new fundamental nonlocal quantum computing diagonal operator-state relations are derived which model the interaction between two adjacent atoms of an entangled atomic chain. Each atom possesses four eigen-states. These relations lead to four momentum-space cyclic transformations and are used as the computation states in one-dimensional cellular automaton. Four interacting half-observable periodic planar states appear with the same Poincare cycle. Due to the space-time rotational symmetry of these operator-state relations, a new type of periodic spherical state can be constructed consisting of eight finite space-time quadrants as the special quantum computing result.

DOI
10.1142/s0219749921500271

Related papers

Entanglement and quantum teleportation conditions from non-local quantum computing theory

Cheng Hsiao Wu

Entanglement and quantum teleportation are two inter-related subjects and can be explained through four fundamental non-local quantum computing diagonal operator-state relations, which model the conservative phase-interaction between two adjacent atoms of an entangled atomic chain. Each model atom possesses four eigen-states. There exists a minimum focus distance between the two atoms for the entanglement to exist. Consequently, there exist perpetual elastic phase-changing events on the entire entangled chain at every discrete time interval that is evaluated and shown here. It is analogous to Newton’s first law of motion in discrete time. Quantum teleportation means every extra $2\pi$ phase between the atoms can be translated in Fourier space into an additional separation distance, a quantized value.

Quantum Information and Computation•Nov 1, 2023•0 citations

Nonlocal Quantum Computing (I)

Cheng Hsiao Wu

New four sets of 16 nonlocal operator–state relations are presented to describe the quantum computing from a chain of atoms that are in superpositions and in entanglement with each together. The derivation of those tensor relations is a presentation to prove the existence of four new nonlocal mathematics based on correct physics foundation. New concepts are presented to establish the correct quantum computing theory. Why qubit-gated approach is not adequate is explained thoroughly.

CRC Press eBooks•Nov 21, 2025•0 citations

Geometric theory of nonlocal two-qubit operations

Jun Zhang, Jiří Vala, Shankar Sastry +1 more

We study nonlocal two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of nonlocal gates is a 3-torus. We derive the invariants for local transformations, and connect these local invariants to the coordinates of the 3-torus. Since different points on the 3-torus may correspond to the same local equivalence class, we use the Weyl group theory to reduce the symmetry. We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base. We then study the properties of perfect entanglers, that is, the two-qubit operations that can generate maximally entangled states from some initially separable states. We provide criteria to determine whether a given two-qubit gate is a perfect entangler and establish a geometric description of perfect entanglers by making use of the tetrahedral representation of nonlocal gates. We find that exactly half the nonlocal gates are perfect entanglers. We also investigate the nonlocal operations generated by a given Hamiltonian. We first study the gates that can be directly generated by a Hamiltonian. Then we explicitly construct a quantum circuit that contains at most three nonlocal gates generated by a two-body interaction Hamiltonian, together with at most four local gates generated by single-qubit terms. We prove that such a quantum circuit can simulate any arbitrary two-qubit gate exactly, and hence it provides an efficient implementation of universal quantum computation and simulation.

arXiv:quant-ph/0209120•Physical Review A•Apr 18, 2003•415 citations

A Yang–Baxter integrable cellular automaton with a four site update rule

Balázs Pozsgay

Abstract We present a one dimensional reversible block cellular automaton, where the time evolution is dictated by a period 3 cycle of update rules. At each time step a subset of the cells is updated using a four site rule with two control bits and two action bits. The model displays rich dynamics. There are three types of stable particles, left movers, right movers and ‘frozen’ bound states that only move as an effect of scattering with the left and right movers. Multi-particle scattering in the system is factorized. We embed the model into the canonical framework of Yang–Baxter integrability by rigorously proving the existence of a commuting set of diagonal-to-diagonal transfer matrices. The construction involves a new type of Lax operator.

arXiv:2106.00696•Journal of Physics A Mathematical and Theoretical•Aug 16, 2021•38 citations

Nonlocal Quantum Computing (II)

Cheng Hsiao Wu

New physical results are explained, such as time crystals, spherical time crystals, and an analogy of Newton’s first law of motion in discrete time. New concept of time and perpetual motions as viewed from a non-Euclidean frame. Why the quantum computing chain is a distributed superconductor is explained, as well as new physical concepts.

CRC Press eBooks•Nov 21, 2025•0 citations

光速限界離散性理論 DLST Ver.11.0.0: Relativistic Recurrence, Actuality, and Closure Boundaries

Scheduler4861

Abstract We present DLST Ver.11.0.0, a compact recurrence-classification framework for exact physical histories, relational time, and relativistic closure. Ver.11 explicitly corrects the earlier interpretation of DLST: finite signal speed, microscopic length, compactness, finite entropy, finite Hilbert dimension, or a discrete evolution label do not by themselves establish a fundamental discrete clock or exact recurrence. The central objects are instead the physical identity space, the stabilizer of an individual state, and the common global kernel of the evolution. This separates state-specific recurrence, universal recurrence, gauge stationarity, and observational indistinguishability. For autonomous discrete quantum evolution, we prove that a common exact projective return for all pure-state rays and density operators exists if and only if the one-step projective update [U] is a torsion element of PU(H), equivalently U^N = exp(i phi) I for some finite N. Membership in a finite projective unitary subgroup is therefore a sufficient special case. Finite-volume exact Clifford dynamics on finitely many prime-dimensional qudits provides an explicit conditional realization: the projective Clifford group is finite, so an exact Clifford quantum cellular automaton has a nonzero common recurrence period. This bridge does not require a finite quantum-state cardinality. Its scope is exact and finite-volume; infinite-lattice Clifford QCA or arbitrarily small irrational non-Clifford phases need not recur globally. Complementary positive criteria are given by finite same-law closure and spectral commensurability. For unitary evolution, exact recurrence of an occupied state requires its active eigenphase or energy differences to lie on a common arithmetic lattice. These results clarify why finite-dimensional Hilbert space alone is insufficient: exact recurrence is controlled by projective order and spectral arithmetic rather than vector-space dimension. The relativistic obstruction side is strengthened. In 1+d-dimensional Poincare-covariant quantum dynamics with d >= 2, if the scalar/projective translation kernel contains any nonzero translation—timelike, spacelike, or null—Lorentz covariance and additivity force the entire translation subgroup into the kernel. Hence a nontrivial translation representation cannot possess a nonzero universal spacetime period. A related connected simple-group obstruction excludes noncentral universal projective periods under the stated representation hypotheses. For relativistic scattering sectors, Haag-Ruelle wave-operator equivalence transfers the asymptotic energy spectral measure to the interacting sector. A nonzero non-atomic energy component is incompatible with the affine spectral lattice required for exact projective return, yielding an exact nonreturn criterion without assuming that every state belongs to the scattering sector. Independently, any strictly monotone extensional physical witness along the complete admitted history forbids exact recurrence. Ver.11 also proves a finite-window nonidentifiability result: for any finite observation horizon and tolerance, one can construct finite-dimensional Hamiltonians whose propagators remain arbitrarily close throughout the observed interval while belonging to different global recurrence classes. Finite measurement precision therefore cannot replace an exact structural bridge from observed dynamics to all-history recurrence. Related audits show that finite Hilbert dimension, Type II_1 finite-entropy language, gauge stationarity, and cosmological labels are not exact recurrence classifiers by themselves. Finite-dimensional completeness is also incompatible with a nontrivial exact continuous unitary representation of the standard connected de Sitter group under the stated assumptions. The resulting classification contains both positive and negative bridges. Positive exact routes include finite same-law closure, projective torsion, finite-volume exact Clifford QCA, and affine spectral lattices. Obstruction and nonreturn routes include Poincare symmetry, non-atomic scattering spectra, and strict extensional monotonicity. Gauge equivalence, compactness, finite observational windows, and coarse finiteness statements remain nonclassifying without additional physical input. The principal methodological change is therefore a shift from presumed temporal discreteness to fail-closed actuality promotion: a recurrence or nonrecurrence claim is promoted only after the physical identity relation, complete evolution law, and exact all-history bridge have been independently specified. DLST Ver.11.0.0 does not establish that the actual universe is periodic, aperiodic, fundamentally discrete in time, a finite Clifford automaton, or governed by a universal microscopic tick. C4 Ver.1.0.0 and OUROBOROS Ver.2.0.0 remain separate downstream research programs rather than premises of DLST. Deterministic reproducibility checks accompany the release for the finite-projective, Clifford-group, spectral, permutation, and finite-window constructions. These computational audits verify explicit finite examples and implementation details; the analytic theorems remain the scientific basis of the classification. DLST Ver.11.0.0 thus provides a compact framework connecting exact recurrence, dynamical stabilizers, projective unitary torsion, Clifford quantum cellular automata, Poincare symmetry, Haag-Ruelle scattering, operator-algebraic finiteness, de Sitter representation theory, and relational physical time under an explicit claim boundary.

•Oct 1, 2026•0 citations
Four new fundamental nonlocal quantum computing diagonal operator-state relations are derived which model the interaction between two adjacent atoms of an entangled atomic chain. Each atom possesses four eigen-states. These relations lead to four momentum-space cyclic transformations and are used as the computation states in one-dimensional cellular automaton. Four interacting half-observable periodic planar states appear with the same Poincare cycle. Due to the space-time rotational symmetry of these operator-state relations, a new type of periodic spherical state can be constructed consisting of eight finite space-time quadrants as the special quantum computing result.
Entanglement and quantum teleportation are two inter-related subjects and can be explained through four fundamental non-local quantum computing diagonal operator-state relations, which model the conservative phase-interaction between two adjacent atoms of an entangled atomic chain. Each model atom possesses four eigen-states. There exists a minimum focus distance between the two atoms for the entanglement to exist. Consequently, there exist perpetual elastic phase-changing events on the entire entangled chain at every discrete time interval that is evaluated and shown here. It is analogous to Newton’s first law of motion in discrete time. Quantum teleportation means every extra 2π2\pi2π phase between the atoms can be translated in Fourier space into an additional separation distance, a quantized value.
We study nonlocal two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of nonlocal gates is a 3-torus. We derive the invariants for local transformations, and connect these local invariants to the coordinates of the 3-torus. Since different points on the 3-torus may correspond to the same local equivalence class, we use the Weyl group theory to reduce the symmetry. We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base. We then study the properties of perfect entanglers, that is, the two-qubit operations that can generate maximally entangled states from some initially separable states. We provide criteria to determine whether a given two-qubit gate is a perfect entangler and establish a geometric description of perfect entanglers by making use of the tetrahedral representation of nonlocal gates. We find that exactly half the nonlocal gates are perfect entanglers. We also investigate the nonlocal operations generated by a given Hamiltonian. We first study the gates that can be directly generated by a Hamiltonian. Then we explicitly construct a quantum circuit that contains at most three nonlocal gates generated by a two-body interaction Hamiltonian, together with at most four local gates generated by single-qubit terms. We prove that such a quantum circuit can simulate any arbitrary two-qubit gate exactly, and hence it provides an efficient implementation of universal quantum computation and simulation.
Abstract We present a one dimensional reversible block cellular automaton, where the time evolution is dictated by a period 3 cycle of update rules. At each time step a subset of the cells is updated using a four site rule with two control bits and two action bits. The model displays rich dynamics. There are three types of stable particles, left movers, right movers and ‘frozen’ bound states that only move as an effect of scattering with the left and right movers. Multi-particle scattering in the system is factorized. We embed the model into the canonical framework of Yang–Baxter integrability by rigorously proving the existence of a commuting set of diagonal-to-diagonal transfer matrices. The construction involves a new type of Lax operator.
Abstract We present DLST Ver.11.0.0, a compact recurrence-classification framework for exact physical histories, relational time, and relativistic closure. Ver.11 explicitly corrects the earlier interpretation of DLST: finite signal speed, microscopic length, compactness, finite entropy, finite Hilbert dimension, or a discrete evolution label do not by themselves establish a fundamental discrete clock or exact recurrence. The central objects are instead the physical identity space, the stabilizer of an individual state, and the common global kernel of the evolution. This separates state-specific recurrence, universal recurrence, gauge stationarity, and observational indistinguishability. For autonomous discrete quantum evolution, we prove that a common exact projective return for all pure-state rays and density operators exists if and only if the one-step projective update [U] is a torsion element of PU(H), equivalently U^N = exp(i phi) I for some finite N. Membership in a finite projective unitary subgroup is therefore a sufficient special case. Finite-volume exact Clifford dynamics on finitely many prime-dimensional qudits provides an explicit conditional realization: the projective Clifford group is finite, so an exact Clifford quantum cellular automaton has a nonzero common recurrence period. This bridge does not require a finite quantum-state cardinality. Its scope is exact and finite-volume; infinite-lattice Clifford QCA or arbitrarily small irrational non-Clifford phases need not recur globally. Complementary positive criteria are given by finite same-law closure and spectral commensurability. For unitary evolution, exact recurrence of an occupied state requires its active eigenphase or energy differences to lie on a common arithmetic lattice. These results clarify why finite-dimensional Hilbert space alone is insufficient: exact recurrence is controlled by projective order and spectral arithmetic rather than vector-space dimension. The relativistic obstruction side is strengthened. In 1+d-dimensional Poincare-covariant quantum dynamics with d >= 2, if the scalar/projective translation kernel contains any nonzero translation—timelike, spacelike, or null—Lorentz covariance and additivity force the entire translation subgroup into the kernel. Hence a nontrivial translation representation cannot possess a nonzero universal spacetime period. A related connected simple-group obstruction excludes noncentral universal projective periods under the stated representation hypotheses. For relativistic scattering sectors, Haag-Ruelle wave-operator equivalence transfers the asymptotic energy spectral measure to the interacting sector. A nonzero non-atomic energy component is incompatible with the affine spectral lattice required for exact projective return, yielding an exact nonreturn criterion without assuming that every state belongs to the scattering sector. Independently, any strictly monotone extensional physical witness along the complete admitted history forbids exact recurrence. Ver.11 also proves a finite-window nonidentifiability result: for any finite observation horizon and tolerance, one can construct finite-dimensional Hamiltonians whose propagators remain arbitrarily close throughout the observed interval while belonging to different global recurrence classes. Finite measurement precision therefore cannot replace an exact structural bridge from observed dynamics to all-history recurrence. Related audits show that finite Hilbert dimension, Type II_1 finite-entropy language, gauge stationarity, and cosmological labels are not exact recurrence classifiers by themselves. Finite-dimensional completeness is also incompatible with a nontrivial exact continuous unitary representation of the standard connected de Sitter group under the stated assumptions. The resulting classification contains both positive and negative bridges. Positive exact routes include finite same-law closure, projective torsion, finite-volume exact Clifford QCA, and affine spectral lattices. Obstruction and nonreturn routes include Poincare symmetry, non-atomic scattering spectra, and strict extensional monotonicity. Gauge equivalence, compactness, finite observational windows, and coarse finiteness statements remain nonclassifying without additional physical input. The principal methodological change is therefore a shift from presumed temporal discreteness to fail-closed actuality promotion: a recurrence or nonrecurrence claim is promoted only after the physical identity relation, complete evolution law, and exact all-history bridge have been independently specified. DLST Ver.11.0.0 does not establish that the actual universe is periodic, aperiodic, fundamentally discrete in time, a finite Clifford automaton, or governed by a universal microscopic tick. C4 Ver.1.0.0 and OUROBOROS Ver.2.0.0 remain separate downstream research programs rather than premises of DLST. Deterministic reproducibility checks accompany the release for the finite-projective, Clifford-group, spectral, permutation, and finite-window constructions. These computational audits verify explicit finite examples and implementation details; the analytic theorems remain the scientific basis of the classification. DLST Ver.11.0.0 thus provides a compact framework connecting exact recurrence, dynamical stabilizers, projective unitary torsion, Clifford quantum cellular automata, Poincare symmetry, Haag-Ruelle scattering, operator-algebraic finiteness, de Sitter representation theory, and relational physical time under an explicit claim boundary.