Related papers: Optimal wire cutting with classical communication
Circuit knitting is a family of techniques that enables large quantum computations on limited-size quantum devices by decomposing a target circuit into smaller subcircuits. However, it typically incurs a measurement overhead exponential in…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
We propose a new method for identifying cutting locations for quantum circuit cutting, with a primary focus on partitioning circuits into three or more parts. Under the assumption that the classical postprocessing function is decomposable,…
Significant efforts are being spent on building a quantum computer. At the same time, developments in quantum software are rapidly progressing. Insufficient quantum resources often are the problem when running quantum algorithms. New…
Quantum algorithms offer an exponential speedup over classical algorithms for a range of computational problems. The fundamental mechanisms underlying quantum computation required the development and construction of quantum computers. These…
Quantum data encoding (QDE) enables faster com-putations than classical algorithms through superposition and en-tanglement. Circuit cutting and knitting are effective techniques for ameliorating current noisy quantum processing unit (QPUs)…
The scalability of solid state quantum computation relies on the ability of connecting the qubits to the macroscopic world. Quantum chains can be used as quantum wires to keep regions of external control at a distance. However even in the…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…
Circuit cutting was originally designed to retrieve the expectation value of an observable with respect to a large quantum circuit by executing smaller circuit fragments. In this work, however, we demonstrate the application of circuit…
Quantum computing promises speedup of classical algorithms in the long term. Current hardware is unable to support this goal and programs must be efficiently compiled to use of the devices through reduction of qubits used, gate count and…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…
We make the case that variational algorithm ansatzes for near-term quantum computing are well-suited for the quantum circuit cutting strategy. Previous demonstrations of circuit cutting focused on the exponential execution and…
In a quantum internet, quantum processing units (QPUs) with varying architectures and capabilities may be connected through quantum communication channels, enabling new applications such as distributed quantum computing (DQC), a paradigm in…
In the context of NISQ computers - Noise Intermediate Scale Quantum, it is a consensus that the distribution of circuits among processing agents is a viable approach to get greater scalability with small machines. This approach can increase…
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar…
Quantum computing is a promising technology to address combinatorial optimization problems, for example via the quantum approximate optimization algorithm (QAOA). Its potential, however, hinges on scaling toy problems to sizes relevant for…
Quantum computing promises to revolutionize problem-solving through quantum mechanics, but current NISQ devices face limitations in qubit count and error rates, hindering the execution of large-scale quantum circuits. To address these…
A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical…
Executing large quantum circuits is not feasible using the currently available NISQ (noisy intermediate-scale quantum) devices. The high costs of using real quantum devices make it further challenging to research and develop quantum…