相关论文: KLM quantum computation as a measurement based com…

Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through…

We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM. The structure of the algorithm allows for more flexibility in modelling different physics in contrast to earlier quantum…

Using electrostatic gates to control the electron positions, we present a new controlled-NOT gate based on quantum dots. The qubit states are chosen to be the spin states of an excess conductor electron in the quantum dot; and the main…

Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…

The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…

Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…

In former work, quantum computation has been shown to be a problem solving process essentially affected by both the reversible dynamics leading to the state before measurement, and the logical-mathematical constraints introduced by quantum…

Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.

In this paper we discuss a model of quantum computer in which a state is an operator of density matrix and gates are general quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum…

A systematic method for simulating small-scale quantum circuits by use of linear optical devices is presented. It relies on the representation of several quantum bits by a single photon, and on the implementation of universal quantum gates…

We show that the quantum dimer state on the Kagome lattice, which was recently realized with high fidelity in a Rydberg quantum simulator [Semeghini et al., Science 374, 6572 (2021)], offers a sufficient resource for universal…

In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the…

Measurement-based quantum computation (MBQC) is a protocol for quantum computation that represents a model distinct from the circuit-based approach. MBQC has been proposed not only for qubits but also for qudits, continuous-variable (CV)…

We use classes of Hilbert lattice equations for an alternative representation of Hilbert lattices and Hilbert spaces of arbitrary quantum systems that might enable a direct introduction of the states of the systems into quantum computers.…

A quantum computer based on an asymmetric coupled dot system has been proposed and shown to operate as the controlled-NOT-gate. The basic idea is (1) the electron is localized in one of the asymmetric coupled dots. (2)The electron transfer…

We propose a version of the non-relativistic quantum mechanics in which the pure states of a quantum system are described as sections of a Hilbert (generally infinitely-dimensional) fibre bundle over the space-time. There evolution is…

We present a method for obtaining evolution operators for linear quantum trajectories. We apply this to a number of physical examples of varying mathematical complexity, in which the quantum trajectories describe the continuous projection…

Quantum computing is a disruptive paradigm widely believed to be capable of solving classically intractable problems. However, the route toward full-scale quantum computers is obstructed by immense challenges associated with the scalability…

Tensor universality often implies that multi-partite quantum-state processing is determined by what happens in totally disentangled cases. In independent systems relative time direction for the parts is arbitrary. This hints that time may…

This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing. We discuss topological diagrams and some issues about…