Related papers: Efficient quantum circuits for Toeplitz and Hankel…
We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…
Advances in quantum computation for electronic structure, and particularly heuristic quantum algorithms, create an ongoing need to characterize the performance and limitations of these methods. Here we discuss some potential pitfalls…
Many quantum algorithms make use of oracles which evaluate classical functions on a superposition of inputs. In order to facilitate implementation, testing, and resource estimation of such algorithms, we present quantum circuits for…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
Quantum compiling means fast, device-aware implementation of quantum algorithms (i.e., quantum circuits, in the quantum circuit model of computation). In this paper, we present a strategy for compiling IBM Q -aware, low-depth quantum…
We develop an efficient quantum implementation of an important signal processing algorithm for line spectral estimation: the matrix pencil method, which determines the frequencies and damping factors of signals consisting of finite sums of…
Parameterised quantum circuits (PQCs) hold great promise for demonstrating quantum advantages in practical applications of quantum computation. Examples of successful applications include the variational quantum eigensolver, the quantum…
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…
Topological quantum computation is a promising technique to achieve large-scale, error-corrected computation. Quantum hardware is used to create a large, 3-dimensional lattice of entangled qubits while performing computation requires…
We develop a sparse hierarchical $hp$-finite element method ($hp$-FEM) for the Helmholtz equation with variable coefficients posed on a two-dimensional disk or annulus. The mesh is an inner disk cell (omitted if on an annulus domain) and…
While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad…
Superconducting quantum technologies require qubit systems whose properties meet several often conflicting requirements, such as long coherence times and high anharmonicity. Here, we provide an engineering framework based on a generalized…
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 annealing is a method to solve optimization problems that leverages quantum tunneling in a coupled qubit system. We present a detailed study of the coherence of a tunable capacitively-shunted flux qubit, designed for coherent…
We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…
It is well known that a Toeplitz operator is invertible if and only if its symbols admits a canonical Wiener-Hopf factorization, where the factors satisfy certain conditions. A similar result holds also for singular integral operators. More…
In this paper we address the problem of translating one-way quantum computation (1WQC) into the circuit model. We start by giving a straightforward circuit representation of any 1WQC, at the cost of introducing many ancilla wires. We then…
We present an efficient and precise framework to quantum simulate the dynamics of the ultra-relativistic quark-nucleus scattering. This framework employs the eigenbasis of the asymptotic scattering system and implements a compact scheme for…
We look for new steps on the dynamical operations that may squeeze simultaneously some families of quantum states, independently of their initial shape, induced by softly acting external fields which might produce the squeezing of the…
We show a pulse-efficient circuit transpilation framework for noisy quantum hardware. This is achieved by scaling cross-resonance pulses and exposing each pulse as a gate to remove redundant single-qubit operations with the…