相关论文: Quantum cellular automata quantum computing with e…

We discuss the role of classical control in the context of reversible quantum cellular automata. Employing the structure theorem for quantum cellular automata, we give a general construction scheme to turn an arbitrary cellular automaton…

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…

Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…

A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations).…

Given the effectiveness of semiconductor devices for classical computation one is naturally led to consider semiconductor systems for solid state quantum information processing. Semiconductors are particularly suitable where local control…

Implementation of quantum information processing faces the contradicting requirements of combining excellent isolation to avoid decoherence with the ability to control coherent interactions in a many-body quantum system. For example, spin…

We propose an approach for single spin measurement. Our method uses techniques from the theory of quantum cellular automata to correlate a large amount of ancillary spins to the one to be measured. It has the distinct advantage of being…

We study classical and quantum spin models derived from one-dimensional cellular automata (CA) with nonlinear update rules, focusing on rules 30, 54 and 201. We argue that the classical models, defined such that their ground states…

Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…

We develop a scalable architecture for quantum computation using controllable electrons of double-dot molecules coupled to a microwave stripline resonator on a chip, which satisfies all Divincenzo criteria. We analyze the performance and…

We propose a complete, quantitative quantum computing system which satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where standard, two-state qubits are formed utilizing the two…

With the help of the spin-orbit interaction, we propose a scheme to perform holonomic single qubit gates on the electron spin confined to a quantum dot. The manipulation is done in the absence (or presence) of an applied magnetic field. By…

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…

The readout of the quantum spin state is a challenge for any spin-based quantum computing implementation. We propose a scheme, based on the achieved technique of single electron transistor (SET), to implement the readout of electronic spin…

We study experimentally demonstrated single-electron ${}^{12}$C CNT QD with significant spin-orbit interaction as a scalable quantum computer candidate. Both electron spin and orbital angular momentum can serve as a logical qubit for…

The design and control of atomic-scale spin structures constitute major challenges for spin-based quantum technology platforms, including quantum dots, color centers, and molecular spins. Here, we showcase a strategy for designing the…

Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…

We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…

We show how the trajectories of $d$-dimensional cellular automata (CA) can be used to determine the ground states of $(d+1)$-dimensional classical spin models, and we characterise their quantum phase transition, when in the presence of a…