相关论文: An Optimization for Qubiter
We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multi-mode Hamiltonian evolution, into a set of universal unitary gates. Although our…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution…
Electron transport in realistic physical and chemical systems often involves the non-trivial exchange of energy with a large environment, requiring the definition and treatment of open quantum systems. Because the time evolution of an open…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most…
Machine learning nowadays becomes a useful instrument in many subjects. In this paper we use interpretable machine learning to build quantum algorithm. By studying the parameters of the machine learning algorithm we were able to construct…
Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To-date, experimental demonstrations of algorithms such as…
We apply quantum integration to elementary particle-physics processes. In particular, we look at scattering processes such as ${\rm e}^+{\rm e}^- \to q \bar q$ and ${\rm e}^+{\rm e}^- \to q \bar q' {\rm W}$. The corresponding probability…
We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier…
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation.…
As quantum computing technology advances, the need for optimized arithmetic circuits continues to grow. This paper presents the implementation and resource estimation of a library of quantum arithmetic algorithms, including addition,…
Making new methods for quantum problems often relies on using basic operations in linear algebra. Often these routines are hidden behind well-known libraries that have been optimized over decades. Attempting to improve on those basic…
Quantum compilation is the process of converting a target unitary operation into a trainable unitary represented by a quantum circuit. It has a wide range of applications, including gate optimization, quantum-assisted compiling, quantum…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
Engineering quantum operations is one of the main abilities we need for developing quantum technologies and designing new fundamental tests. Here we propose a scheme for realising a controlled operation acting on a travelling quantum field,…
In this paper, we propose an iterative algorithm using polar decomposition to approximate a channel characterized by a single unitary matrix based on input-output quantum state pairs. In limited data, we state and prove that the optimal…