Related papers: Universal quantum computation with quantum-dot cel…
This research describes a three dimensional quantum cellular automaton (QCA) which can simulate all other 3D QCA. This intrinsically universal QCA belongs to the simplest subclass of QCA: Partitioned QCA (PQCA). PQCA are QCA of a particular…
We present a general framework for constructing quantum cellular automata (QCA) from topological quantum field theories (TQFT) and invertible subalgebras (ISA) using the cup-product formalism. This approach explicitly realizes all…
A fundamental goal in the manipulation of quantum systems is the achievement of many coherent oscillations within the characteristic dephasing time T2*[1]. Most manipulations of electron spins in quantum dots have focused on the…
We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
Quantum dot Cellular Automata (QCA) is the most promising nanotechnology in the field of microelectronics and VLSI systems. QCA-based circuits require less power with a high switching speed of operation compared to CMOS technology. QCA…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…
We introduce a novel scheme for one-way quantum computing (QC) based on the use of information encoded qubits in an effective cluster state resource. With the correct encoding structure, we show that it is possible to protect the entangled…
While quantum computers have shown significant promise for electronic structure calculations, their potential to accelerate density functional theory (DFT) calculations remains unclear. In this work, we present a qubit-efficient encoding…
We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state…
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…
We present a quantum cellular automaton model in one space-dimension which has the Dirac equation as emergent. This model, a discrete-time and causal unitary evolution of a lattice of quantum systems, is derived from the assumptions of…
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of…
Goldilocks quantum cellular automata (QCA) have been simulated on quantum hardware and produce emergent small-world correlation networks. In Goldilocks QCA, a single-qubit unitary is applied to each qubit in a one-dimensional chain subject…
Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting…
We present an efficient proposal for error-rejecting quantum computing with quantum dots (QD) embedded in single-sided optical microcavities based on the interface between the circularly polarized photon and QDs. An almost unity fidelity of…
Quantum registers of nuclear spins coupled to electron spins of individual solid-state defects are a promising platform for quantum information processing. Pioneering experiments selected defects with favourably located nuclear spins having…
Any residual coupling of a quantum computer to the environment results in computational errors. Encoding quantum information in a so-called decoherence-free subspace provides means to avoid these errors. Despite tremendous progress in…
With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess…
Active quantum error correction on topological codes is one of the most promising routes to long-term qubit storage. In view of future applications, the scalability of the used decoding algorithms in physical implementations is crucial. In…