Related papers: Suggestion on Quantum Computer Circuits
Recently, it is shown that quantum computers can be used for obtaining certain information about the solution of a linear system Ax=b exponentially faster than what is possible with classical computation. Here we first review some key…
Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning…
Quantum computers have the potential to solve some important industrial and scientific problems with greater efficiency than classical computers. While most current realizations focus on two-level qubits, the underlying physics used in most…
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum…
The quantum switch is a higher-order operation that takes as an input two quantum processes and combines them in a coherent superposition of two alternative orders. Here we provide an approach to the quantum switch based on the methods of…
Josephson junctions have demonstrated enormous potential as qubits for scalable quantum computing architectures. Here we discuss the current approaches for making multi-qubit circuits and performing quantum information processing with them.
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum circuits are the preferred formalism for expressing quantum information processing tasks. Quantum circuit design automation methods mostly use a waterfall approach and consider that high level circuit descriptions are hardware…
The aim of this paper is to introduce a new graphic representation of quantum states by means of a specific application: the analysis of two models of quantum copying machines. The graphic representation by diagrams of states offers a clear…
A factor-graph representation of quantum-mechanical probabilities (involving any number of measurements) is proposed. Unlike standard statistical models, the proposed representation uses auxiliary variables (state variables) that are not…
An architecture for a quantum computer is presented in which spins associated with donors in silicon function as qubits. Quantum operations on the spins are performed using a combination of voltages applied to gates adjacent to the spins…
In this short review we describe the process of designing a superconducting circuit device for quantum information applications. We discuss the factors that must be considered to implement a desired effective Hamiltonian on a device. We…
We propose a variational scheme to represent composite quantum systems using multiple parameterized functions of varying accuracies on both classical and quantum hardware. The approach follows the variational principle over the entire…
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
We consider some simple examples of supersymmetric quantum mechanical systems and explore their possible geometric interpretation with the help of geometric aspects of real Clifford algebras. This leads to natural extensions of the…
Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to…
Quantum circuits that generate coherent superpositions of stochastic processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing. However, traditional methods for designing…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and…
We present the solid-state quantum circuits that have been developed in order to implement quantum bits suitable for a quantum processor. These qubits are either based on the quantum state of a single particle (semiconductor qubits), or on…