Related papers: Cutting Quantum Circuits Beyond Qubits
Simulations of quantum dynamics are a key application of near term quantum computing, but are hindered by the twin challenges of noise and small device scale, which limit the executable circuit depths and the number of qubits the algorithm…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
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…
Quantum computing offers unparalleled computational capabilities but faces significant challenges, including limited qubit counts, diverse hardware topologies, and dynamic noise/error rates, which hinder scalability and reliability.…
The development of complex circuits for practical applications in the current quantum computing ecosystem is based on basic primitives such as Bell states, which provide superposition, entanglement, and coherence. The range of…
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…
Quantum information processing is expressed using quantum bits (qubits) and quantum gates which are arranged in the terms of quantum circuits. Here, each qubit is associated to a quantum circuit wire which is used to conduct the desired…
Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with…
Realizing the advantages of quantum computation requires access to the full Hilbert space of states of many quantum bits (qubits). Thus, large-scale quantum computation faces the challenge of efficiently generating entanglement between many…
Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum…
Shallow quantum circuits feature not only computational advantages over their classical counterparts but also cutting-edge applications. Storing quantum information generated by shallow circuits is a fundamental question of both theoretical…
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…
Classical simulation of quantum circuits is crucial for evaluating and validating the design of new quantum algorithms. However, the number of quantum state amplitudes increases exponentially with the number of qubits, leading to the…
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,…
Recurrent quantum models (RQMs) realize sequential quantum processes through repeated application of a unitary operation on a memory system coupled with a series of output registers. However, such models often rely on unnecessarily large…
In this project we examine several different quantum key distribution protocols which we divide into ones utilizing qubits whose Hilbert spaces are two dimensional and ones whose Hilbert space dimension is greater than two, these units of…
Qubit reuse offers a promising way to reduce the hardware demands of quantum circuits, but current approaches are largely restricted to reordering measurements and applying qubit resets. In this work, we present an approach to further…
Quantum circuit simulation provides the foundation for the development of quantum algorithms and the verification of quantum supremacy. Among the various methods for quantum circuit simulation, tensor network contraction has been increasing…
We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…