Related papers: Configurable sublinear circuits for quantum state …
While many classical algorithms rely on Laplace transforms, it has remained an open question whether these operations could be implemented efficiently on quantum computers. In this work, we introduce the Quantum Laplace Transform (QLT),…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
Reducing circuit depth and identifying an optimal trade-off between circuit depth and width is crucial for successful quantum computation. In this context, midcircuit measurement and feedforward have been shown to significantly reduce the…
Quantum state tomography is a key process in most quantum experiments. In this work, we employ quantum machine learning for state tomography. Given an unknown quantum state, it can be learned by maximizing the fidelity between the output of…
Modular quantum computing architectures are a promising alternative to monolithic QPU (Quantum Processing Unit) designs for scaling up quantum devices. They refer to a set of interconnected QPUs or cores consisting of tightly coupled…
We describe a qubit encoded in continuous quantum variables of an rf superconducting quantum interference device. Since the number of accessible states in the system is infinite, we may protect its two-dimensional subspace from small errors…
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some…
Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of…
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. Circuit cutting techniques enable the distribution of quantum computations through classical…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…
Multigrid has become a popular method for solving some of the most challenging real-world computational problems, such as computational fluid dynamics (CFD). The reason for this is the very good scaling properties of multigrid, which is…
A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal…
The standard paradigm for state preparation on quantum computers for the simulation of physical systems in the near term has been widely explored with different algorithmic methods. One such approach is the optimization of parameterized…
The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for skewed linear systems for…
Quantum computing holds transformative potential for medical applications, yet efficiently preparing quantum states from complex medical data remains a fundamental challenge. This survey provides a comprehensive examination of current…
Classical data encoding is usually treated as a black-box in the oracle-based quantum algorithms. On the other hand, their constructions are crucial for practical algorithm implementations. Here, we open the black-boxes of data encoding and…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
Satisfiability Testing (SAT) techniques are well-established in classical computing where they are used to solve a broad variety of problems, e.g., in the design of classical circuits and systems. Analogous to the classical realm, quantum…
Quantum superposition and entanglement of physical states can be harnessed to solve some problems which are intractable on a classical computer implementing binary logic. Several algorithms have been proposed to utilize the quantum nature…