Related papers: Optimum multiplexer design in quantum-dot cellular…
We introduce an adaptable and modular hybrid architecture designed for fault-tolerant quantum computing. It combines quantum emitters and linear-optical entangling gates to leverage the strength of both matter-based and photonic-based…
We introduce a novel algorithm for the task of coherently controlling a quantum mechanical system to implement any chosen unitary dynamics. It performs faster than existing state of the art methods by one to three orders of magnitude…
After the first treatments of quantum finite state automata by Moore and Crutchfield and by Kondacs and Watrous, a number of papers study the power of quantum finite state automata and their variants. This paper introduces a model of…
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…
In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
In the current NISQ era, there is demand for functional quantum devices to solve relevant computational problems, which motivates a utilitarian perspective on device design: The goal is to create a device that is able to run a given…
The Collatz, or 3x+1, Conjecture claims that for every positive integer n, there exists some k such that T^k(n)=1, where T is the Collatz map. We present three cellular automata (CA) that transform the global problem of mimicking the…
Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method…
Quantum computing represents a paradigm shift in computation, offering the potential to solve complex problems intractable for classical computers. Although current quantum processors already consist of a few hundred of qubits, their…
The aircraft loading optimization problem is a computationally hard problem with the best known classical algorithm scaling exponentially with the number of objects. We propose a quantum approach based on a multi-angle variant of the QAOA…
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…
This paper presents the definition and implementation of a quantum computer architecture to enable creating a new computational device - a quantum computer as an accelerator. In this paper, we present explicitly the idea of a quantum…
A new physical implementation for quantum computation is proposed. The vibrational modes of molecules are used to encode qubit systems. Global quantum logic gates are realized using shaped femtosecond laser pulses which are calculated…
This paper considers joint beamformer design towards maximizing the mutual information in a coherent wireless sensor network with noisy observation and multiple antennae. Leveraging the weighted minimum mean square error and block…
We discuss the hardware design choices made in our 16K-node 0.8 Teraflops supercomputer project, a machine architecture optimized for full QCD calculations. The efficiency of the conjugate gradient algorithm in terms of balance of…
The author analyzes quantum computation with the hybrid qubit (HQ) that is encoded using the three-electron configuration of a double quantum dot. All gate operations are controlled with electric signals, while the qubit remains at an…
Quantitative automata model beyond-boolean aspects of systems: every execution is mapped to a real number by incorporating weighted transitions and value functions that generalize acceptance conditions of boolean $\omega$-automata. Despite…
Over an arbitrary commutative ring $R$, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space $\mathbf{Q}(X)$ of quantum cellular automata (QCA) on a given metric space $X$. In most cases of…