Related papers: Matrix multiplication using quantum-dot cellular a…
Recent experiments have demonstrated a working cell suitable for implementing the Quantum-dot Cellular Automata (QCA) paradigm. These experiments have been performed using metal island clusters. The most promising approach to QCA operation…
We show how "single" quantum dots, each hosting a singlet-triplet qubit, can be placed in arrays to build a spin quantum cellular automaton. A fast ($\sim 10$ ns) deterministic coherent singlet-triplet filtering, as opposed to current…
Very much as its classical counterpart, quantum cellular automata are expected to be a great tool for simulating complex quantum systems. Here we introduce a partitioned model of quantum cellular automata and show how it can simulate, with…
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…
A Quantum Cellular Automaton (QCA) is essentially an operator driving the evolution of particles on a lattice, through local unitaries. Because $\Delta_t=\Delta_x = \epsilon$, QCAs constitute a privileged framework to cast the digital…
Digital circuits based on residue number systems have been considered to produce a pseudo-random behavior. The present work is an initial step towards the complete implementation of those systems for similar applications using quantum…
If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where…
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
The physical limitations of CMOS technology triggered several research for finding an alternative technology. QCA is one of the emerging nanotechnologies which is gaining attention as a substitute of CMOS. The main potential of QCA is its…
Matrix multiplication is a fundamental classical computing operation whose efficiency becomes a major challenge at scale, especially for machine learning applications. Quantum computing, with its inherent parallelism and exponential storage…
Optical computing harnesses the speed of light to perform vector-matrix operations efficiently. It leverages interference, a cornerstone of quantum computing algorithms, to enable parallel computations. In this work, we interweave quantum…
A switched-capacitor matrix multiplier is presented for approximate computing and machine learning applications. The multiply-and-accumulate operations perform discrete-time charge-domain signal processing using passive switches and 300 aF…
We study probabilistic cellular automata (PCA) and quantum cellular automata (QCA) as frameworks for solving the Maximum Independent Set (MIS) problem. We first introduce a synchronous PCA whose dynamics drives the system toward the…
A task-based formulation of Scalable Universal Matrix Multiplication Algorithm (SUMMA), a popular algorithm for matrix multiplication (MM), is applied to the multiplication of hierarchy-free, rank-structured matrices that appear in the…
Large-scale programmable photonic circuits are opening up new possibilities for information processing providing fast and energy-efficient means for matrix-vector multiplication. Here, we introduce a novel architecture of photonic circuits…
We propose a prime factoring machine operated in a frame work of quantum annealing (QA). The idea is inverse operation of a quantum-mechanically reversible multiplier implemented with QA-based Boolean logic circuits. We designed the QA…
The success probability in an ancilla based circuit generally decreases exponentially in the number of qubits consisted in the ancilla. Although the probability can be amplified through the amplitude amplification process, the input…
Power ISA(TM) Version 3.1 has introduced a new family of matrix math instructions, collectively known as the Matrix-Multiply Assist (MMA) facility. The instructions in this facility implement numerical linear algebra operations on small…
Modern Neural Network (NN) architectures heavily rely on vast numbers of multiply-accumulate arithmetic operations, constituting the predominant computational cost. Therefore, this paper proposes a high-throughput, scalable and energy…