Related papers: Programmable Crossbar Quantum-dot Cellular Automat…
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular…
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…
Confining electrons or holes in quantum dots formed in the channel of industry-standard fully depleted silicon-on-insulator CMOS structures is a promising approach to scalable qubit architectures. In this article, we present our results on…
Quantum-dot Cellular Automata (QCA) provides a basis for classical computation without transistors. Many simulations of QCA rely upon the so-called Intercellular Hartree Approximation (ICHA), which neglects the possibility of entanglement…
We formulate a new concept for computing with quantum cellular automata composed of arrays of nanostructured superconducting devices. The logic states are defined by the position of two trapped flux quanta (vortices) in a 2x2…
In this paper we discuss an efficient technique that can implement any given Boolean function as a quantum circuit. The method converts a truth table of a Boolean function to the corresponding quantum circuit using a minimal number of…
In this paper we identify full list of Elementary Cellular Automata rules which can be simulated using a quantum circuit (there are 22 such rules). For every such rule we present quantum circuit implementing it with $O(N)$ gates.
First solid state quantum computer was built using transmons (cooper pair boxes). The operation of the computer is limited because of using a number of the rigit cooper boxes working with fixed frequency at temperatures of superconducting…
Quantum point contact or QPC -- a constriction in a semiconducting two-dimensional (2D) electron system with a quantized conductance -- has been found as the building block of novel spintronic, and topological electronic circuits. They can…
A central challenge for the scaling of quantum computing systems is the need to control all qubits in the system without a large overhead. A solution for this problem in classical computing comes in the form of so called crossbar…
The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the…
We propose a model of a programmable quantum processing device realizable with existing nanophotonic technologies and which can be viewed as a basis for new high performance hardware architectures. We present protocols and their physical…
A quantum cellular network with a qubit and ancilla bits in each cell is proposed. The whole circuit works only with the help of external optical pulse sequences. In the operation, some of the ancilla bits are activated, and autonomous…
Quantum computing has gained attention in recent years due to the significant progress in quantum computing technology. Today many companies like IBM, Google and Microsoft have developed quantum computers and simulators for research and…
Quantum circuits utilizing real time feedback techniques (such as active reset and mid-circuit measurement) are a powerful tool for NISQ-era quantum computing. Such techniques are crucial for implementing error correction protocols, and can…
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of…
Spins based in silicon provide one of the most promising architectures for quantum computing. Quantum dots are an inherently scalable technology. Here, we combine these two concepts into a workable design for a silicon-germanium quantum…
A serial triple quantum dot (TQD) electrostatically defined in a GaAs/AlGaAs heterostructure is characterized by using a nearby quantum point contact as charge detector. Ground state stability diagrams demonstrate control in the regime of…