Related papers: Parallel Quantum Computing Emulation
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
Quantum simulations consist in the intentional reproduction of physical or unphysical models into another more controllable quantum system. Beyond establishing communication vessels between unconnected fields, they promise to solve complex…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
We propose a new physical approach for encoding and processing of quantum information in ensembles of multi-level quantum systems, where the different bits are not carried by individual particles but associated with the collective…
Quantum computing is currently gaining significant attention, not only from the academic community but also from industry, due to its potential applications across several fields for addressing complex problems. For any practical problem…
We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…
Distributed quantum computing is motivated by the difficulty in building large-scale, individual quantum computers. To solve that problem, a large quantum circuit is partitioned and distributed to small quantum computers for execution.…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
We present a new approach to scalable quantum computing--a ``qubus computer''--which realises qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be ``static'' matter qubits…
Recent development in quantum information sciences and technologies, especially building programmable quantum computers, provide us new opportunities to study fundamental aspects of quantum mechanics. We propose qubit models to emulate the…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…
Quantum computer possesses quantum parallelism and offers great computing power over classical computer \cite{er1,er2}. As is well-know, a moving quantum object passing through a double-slit exhibits particle wave duality. A quantum…
We present a new implementation of quantum computation that treats quantum computers as a special type of Bayesian Network called a QuDot Net. QuDot Nets allow for the efficient representation of some qubit systems. Single qubit quantum…
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…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
Parallel Quantum Annealing is a technique to solve multiple optimization problems simultaneously. Parallel quantum annealing aims to optimize the utilization of available qubits on a quantum topology by addressing multiple independent…
While quantum computing holds immense potential for tackling previously intractable problems, its current practicality remains limited. A critical aspect of realizing quantum utility is the ability to efficiently interface with data from…
The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…