相关论文: Quaternionic Computing
We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially with an increase in the number of qubits. However, by using a…
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…
We introduce a novel software-oriented model of quantum computation motivated by the practical constraints of near-term quantum hardware. In this model, gates are specified by constraints expressed in terms of Pauli observables, with each…
We elucidate the profound connection between physics and computation by proposing and examining the model of the non-Hermitian quantum computer (NQC). In addition to conventional quantum gates such as the Hadamard, phase, and CNOT gates,…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction…
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…
This paper presents a novel way to use the algebra of unit quaternions to express arbitrary roots or fractional powers of single-qubit gates, and to use such fractional powers as generators for algebras that combine these fractional input…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in…
Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming languages essentially function as circuit description languages.…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
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…