5,235 research outputs found
Quantum Cellular Automata
Quantum cellular automata (QCA) are reviewed, including early and more recent
proposals. QCA are a generalization of (classical) cellular automata (CA) and
in particular of reversible CA. The latter are reviewed shortly. An overview is
given over early attempts by various authors to define one-dimensional QCA.
These turned out to have serious shortcomings which are discussed as well.
Various proposals subsequently put forward by a number of authors for a general
definition of one- and higher-dimensional QCA are reviewed and their properties
such as universality and reversibility are discussed.Comment: 12 pages, 3 figures. To appear in the Springer Encyclopedia of
Complexity and Systems Scienc
Block Circulant and Toeplitz Structures in the Linearized Hartree–Fock Equation on Finite Lattices: Tensor Approach
This paper introduces and analyses the new grid-based tensor approach to
approximate solution of the elliptic eigenvalue problem for the 3D
lattice-structured systems. We consider the linearized Hartree-Fock equation
over a spatial lattice for both periodic and
non-periodic problem setting, discretized in the localized Gaussian-type
orbitals basis. In the periodic case, the Galerkin system matrix obeys a
three-level block-circulant structure that allows the FFT-based
diagonalization, while for the finite extended systems in a box (Dirichlet
boundary conditions) we arrive at the perturbed block-Toeplitz representation
providing fast matrix-vector multiplication and low storage size. The proposed
grid-based tensor techniques manifest the twofold benefits: (a) the entries of
the Fock matrix are computed by 1D operations using low-rank tensors
represented on a 3D grid, (b) in the periodic case the low-rank tensor
structure in the diagonal blocks of the Fock matrix in the Fourier space
reduces the conventional 3D FFT to the product of 1D FFTs. Lattice type systems
in a box with Dirichlet boundary conditions are treated numerically by our
previous tensor solver for single molecules, which makes possible calculations
on rather large lattices due to reduced numerical
cost for 3D problems. The numerical simulations for both box-type and periodic
lattice chain in a 3D rectangular "tube" with up to
several hundred confirm the theoretical complexity bounds for the
block-structured eigenvalue solvers in the limit of large .Comment: 30 pages, 12 figures. arXiv admin note: substantial text overlap with
arXiv:1408.383
Computing generators of the unit group of an integral abelian group ring
We describe an algorithm for obtaining generators of the unit group of the
integral group ring ZG of a finite abelian group G. We used our implementation
in Magma of this algorithm to compute the unit groups of ZG for G of order up
to 110. In particular for those cases we obtained the index of the group of
Hoechsmann units in the full unit group. At the end of the paper we describe an
algorithm for the more general problem of finding generators of an arithmetic
group corresponding to a diagonalizable algebraic group
Ground states and formal duality relations in the Gaussian core model
We study dimensional trends in ground states for soft-matter systems.
Specifically, using a high-dimensional version of Parrinello-Rahman dynamics,
we investigate the behavior of the Gaussian core model in up to eight
dimensions. The results include unexpected geometric structures, with
surprising anisotropy as well as formal duality relations. These duality
relations suggest that the Gaussian core model possesses unexplored symmetries,
and they have implications for a broad range of soft-core potentials.Comment: 7 pages, 1 figure, appeared in Physical Review E (http://pre.aps.org
Quantum Computing on Lattices using Global Two-Qubit Gate
We study the computation power of lattices composed of two dimensional
systems (qubits) on which translationally invariant global two-qubit gates can
be performed. We show that if a specific set of 6 global two qubit gates can be
performed, and if the initial state of the lattice can be suitably chosen, then
a quantum computer can be efficiently simulatedComment: 9 page
- …