相关论文: A Rudimentary Quantum Compiler

We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…

We introduce an abstract machine architecture for classical/quantum computations---including compilation---along with a quantum instruction language called Quil for explicitly writing these computations. With this formalism, we discuss…

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…

The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…

We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…

Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…

Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…

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…

We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…

Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…

Unitary operation is an essential step for quantum information processing. We first propose an iterative procedure for decomposing a general unitary operation without resorting to controlled-NOT gate and single-qubit rotation library. Based…

In this paper, we present a general quantum computation compiler, which maps any given quantum algorithm to a quantum circuit consisting a sequential set of elementary quantum logic gates based on recursive cosine-sine decomposition. The…

Current quantum programming is dominated by low-level, circuit-centric approaches that limit the potential for compiler optimization. This work presents how a high-level programming construct provides compilers with the semantic information…

The ability of implementing quantum operations plays fundamental role in manipulating quantum systems. Creation and annihilation operators which transform a quantum state to another by adding or subtracting a particle are crucial of…

The software package \emph{Qcompiler} (CPC, 184 (2013) 853) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this…

To assess whether a gate-based quantum algorithm can be executed successfully on a noisy intermediate-scale quantum (NISQ) device, both complexity and actual value of quantum resources should be considered carefully. Based on quantum phase…

We introduce a hybrid quantum-classical framework for efficiently implementing approximate unitary dilations of non-unitary operators with enhanced noise resilience. The method embeds a target non-unitary operator into a subblock of a…

A quantum processor is a programmable quantum circuit in which both the data and the program, which specifies the operation that is carried out on the data, are quantum states. We study the situation in which we want to use such a processor…

Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to…

While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…