Related papers: Exact and approximate continuous-variable gate dec…
We analyze a scheme for quantum computation where quantum gates can be continuously changed from standard dynamic gates to purely geometric ones. These gates are enacted by controlling a set of parameters that are subject to unwanted…
We consider the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates with the primary target being the minimization of the CNOT count. First we note that…
Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
The CUR matrix decomposition is an important extension of Nystr\"{o}m approximation to a general matrix. It approximates any data matrix in terms of a small number of its columns and rows. In this paper we propose a novel randomized CUR…
We present a framework for the implementation of quantum finite automata algorithms designed for the language $ MOD_p = \{ a^{i\cdot p } \mid i \geq 0 \}$ on gate-based quantum computers. First, we compile the known theoretical results from…
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…
We propose a method for applying the quantum error-correction method for errors that occur during quantum gates. Using a perturbation treatment of the noise that allows us to separate it from the ideal evolution of the quantum gate, we…
The inevitable existence of static internal imperfections and residual interactions in some quantum computer architectures result in internal decoherence, dissipation, and destructive unitary shifts of active algorithms. By exact numerical…
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…
Efficient arithmetic circuit design for resourceconstrained hardware involves challenging combinatorial optimization problems, among which Multiple Constant Multiplication (MCM) is a prominent example. MCM aims at implementing…
We propose a method for obtaining the Schmidt decomposition of bipartite systems with continuous variables. It approximates the modes to the prescribed accuracy by well known orthogonal functions. We give some criteria for the control of…
The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices due to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall…
Silicon quantum dot devices stand as promising candidates for large-scale quantum computing due to their extended coherence times, compact size, and recent experimental demonstrations of sizable qubit arrays. Despite the great potential,…
The fidelity of quantum operations is often limited by incoherent errors, which typically can be modeled by fundamental Markovian noise processes such as amplitude damping and dephasing. In Phys. Rev. Lett. 129, 150504 (2022;…
Characterizing errors on many-qubit quantum computers remains a key challenge to understanding and improving the performance of these devices. Current characterization methods either don't scale beyond a few qubits, or make simplifying…
The concrete schemes to realize three types of basic quantum logical gates using linear quadripartite cluster states of optical continuous variables are proposed. The influences of noises and finite squeezing on the computation precision…
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 revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
Variational quantum algorithms have emerged as a powerful tool for harnessing the potential of near-term quantum devices to address complex challenges across quantum science and technology. Yet, the robust and scalable quantification of…