Related papers: Universal quantum computation with quantum-dot cel…
The ability to perform high-precision one- and two-qubit operations is sufficient for universal quantum computation. For the Loss-DiVincenzo proposal to use single electron spins confned to quantum dots as qubits, it is therefore sufficient…
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 field of Electronic Design Automation (EDA) is crucial for microelectronics, but the increasing complexity of Integrated Circuits (ICs) poses challenges for conventional EDA: Corresponding problems are often NP-hard and are therefore in…
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different…
Decoherence-free subspaces and subsystems (DFS) preserve quantum information by encoding it into symmetry-protected states unaffected by decoherence. An inherent DFS of a given experimental system may not exist; however, through the use of…
A central task towards building a practical quantum computer is to protect individual qubits from decoherence while retaining the ability to perform high-fidelity entangling gates involving arbitrary two qubits. Here we propose and…
A theoretical spin-based scheme for performing a variety of quantum computations is presented. It makes use of an array of multiple identical computer vectors of phosphorus-doped silicon where the nuclei serve as logical qubits and the…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Quantum signal processing (QSP) has emerged as a unifying subroutine in quantum algorithms. In QSP, we are given a function $f$ and a unitary black-box $U$, and the goal is to construct a quantum circuit for implementing $f(U)$ to a given…
Decoherence-free subspaces (DFS) in systems of dipole-dipole interacting multi-level atoms are investigated theoretically. It is shown that the collective state space of two dipole-dipole interacting four-level atoms contains a…
We propose a physical realization of quantum cellular automata (QCA) using arrays of ultracold atoms excited to Rydberg states. The key ingredient is the use of programmable multifrequency couplings which generalize the Rydberg blockade and…
Decoherence-free subspace (DFS) provides a crucial mechanism for passive error mitigation in quantum computation by encoding information within symmetry-protected subspaces of the Hilbert space, which are immune from collective decoherence.…
We investigate the usefulness and viability of the scheme developed by Viola and Lloyd [Phys. Rev. A 58, 2733 (1998)] to control dephasing in the context of exciton-based quantum computation with self-assembled quantum dots. We demonstrate…
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…
A decoherence-free subspace (DFS) isolates quantum information from deleterious environmental interactions. We give explicit sequences of strong and fast (``bang-bang'', BB) pulses that create the conditions allowing for the existence of…
Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge…
A new model of a Quantum Automaton (QA), working with qubits is proposed. The quantum states of the automaton can be pure or mixed and are represented by density operators. This is the appropriated approach to deal with measurements and…
We propose a scheme to implement quantum computation in decoherence-free subspace with superconducting devices inside a cavity by unconventional geometric manipulation. Universal single-qubit gates in encoded qubit can be achieved with…
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state $\vert \Psi \rangle$ onto an optimal quantum circuit $\hat{\mathcal{C}}$ with a finite number of single- and two-qubit quantum gates. The proposed…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…