相关论文: Quantum computation with scattering matrices

This note reviews prospects for quantum computing. It argues that gates need to be tested for a wide range of probability amplitudes.

An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…

We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…

In all the various proposals for quantum computers, a common feature is that the quantum circuits are expected to be made of cascades of unitary transformations acting on the quantum states. A framework is proposed to express these…

The applications of geometric control theory methods on Lie groups and homogeneous spaces to the theory of quantum computations are investigated. These methods are shown to be very useful for the problem of constructing an universal set of…

A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into…

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…

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.…

According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…

We use one photon to simulate an n-qubit quantum system for the first time. We propose a new scheme to realize universal quantum computation in polynomial time O(n^5). A generating set of gates can be realized with high accuracy in the lab.…

Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…

We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in…

Quantum computers are becoming real, and they have the inherent potential to significantly impact many application domains. We sketch the basics about programming quantum computers, showing that quantum programs are typically hybrid…

Background: Path integrals are a powerful tool for solving problems in quantum theory that are not amenable to a treatment by perturbation theory. Most path integral computations require an analytic continuation to imaginary time. While…

A fully optical method to perform any quantum computation with optical waveguide modes is proposed by supplying the prescriptions for a universal set of quantum gates. The proposal for quantum computation is based on implementing a quantum…

Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…

We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We…

We present a solution method for the inverse scattering problem for integrable two-dimensional relativistic quantum field theories, specified in terms of a given massive single particle spectrum and a factorizing S-matrix. An arbitrary…

We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…