Executing quantum algorithms over distributed quantum systems requires quantum circuits to be divided into sub-circuits which communicate via entanglement-based teleportation. Naively mapping circuits to qubits over multiple quantum processing units (QPUs) results in large communication overhead, increasing both execution time and noise. This can be minimised by optimising the assignment of qubits to QPUs and the methods used for covering non-local operations. Formulations that are general enough to capture the spectrum of teleportation possibilities lead to complex problem instances which can be difficult to solve effectively. This highlights a need to exploit the wide range of heuristic techniques used in the graph partitioning literature. This paper formalises and extends existing constructions for graphical quantum circuit partitioning and designs a new objective function that captures further possibilities for non-local operations via nested state teleportation. We adapt the well-known Fiduccia-Mattheyses heuristic to the constraints and problem objective and explore multilevel techniques that coarsen hypergraphs and partition at multiple levels of granularity. We find that this reduces runtime and improves solution quality of standard partitioning. We place these techniques within a larger framework, through which we can extract full distributed quantum circuits including teleportation instructions. We compare the entanglement requirements and runtimes with state-of-the-art methods, finding that we achieve the lowest entanglement costs in most cases. Averaging over a wide range of circuits, we reduce the entanglement requirements by 35% compared with the next best-performing method. We also find that our techniques can scale to much larger circuit sizes than competing methods, provided the number of partitions is not too large.
Multilevel Circuit Optimization in Quantum Compilers: A Case Study
IBM Quantum Japan（IBM量子日本）；Quantum Computing Center, Keio University（庆应义塾大学量子计算中心）；Toyota Central R&D Labs., Inc.（丰田中央研发研究所）；Department of Applied Physics and Physico-Informatics, Keio University（庆应义塾大学应用物理与物理信息学系）
We theoretically study operations with a four-level superconducting circuit as a two-qubit system. Using a mapping on a two-qubit system, we show how to implement iSWAP gates and Hadamard gates through pulses on transitions between particular pairs of energy levels. Our approach allows one to prepare pure two-qubit entangled states with desired form of reduced density matrices of the same purity and, in particular, arbitrary identical reduced states of qubits. We propose using schemes for the Hadamard gate and two-qubit entangled states with identical reduced density matrices in order to verif…
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 the combined computational power at the cost of dedicating qubits to get the communication between partitions. Then comes the challenge of reducing this cost of communication-based on efficient circuit partitioning strategies. In this context, this work aims to reduce the consumption of communication qubits generated during the physical partitioning of quan…
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multiple agents, minimising quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimisers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier transformed integers have appeared in the literature for two level qubits. Here we extend these techniques on multilevel qudits, as they may offer some advantages relative to qubits implementations. The arithmetic circuits presented can be used as basi…
The steady state heat currents of continuous absorption machines can be decomposed into thermodynamically consistent contributions, each of them associated with a circuit in the graph representing the master equation of the thermal device. We employ this tool to study the functioning of absorption refrigerators and heat transformers with an increasing number of active levels. Interestingly, such an analysis is independent of the particular physical implementation (classical or quantum) of the device. We provide new insights into the understanding of scaling up thermal devices concerning both t…
We consider the interaction of a small quantum system (a qubit) with a structured environment consisting on many levels. The qubit will experience a decoherence process, which implies that its initial information will be transferred to the environment. We investigate how this information is distributed on a given subset of levels as a function of its size, using the mutual information between both entities, in the spirit of the partial information plots studied by Zurek. In this case we observe some differences, which arise from the fact that we are partitioning just one quantum system, and no…
Qubit measurements are central to quantum information processing. In the field of superconducting qubits, standard readout techniques are not only limited by the signal-to-noise ratio, but also by state relaxation during the measurement. In this work, we demonstrate that the limitation due to relaxation can be suppressed by using the many-level Hilbert space of superconducting circuits: in a multilevel encoding, the measurement is only corrupted when multiple errors occur. Employing this technique, we show that we can directly resolve transmon gate errors at the level of one part in $10^3.$ Ex…
Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into acyclic sub-graphs/circuits that exhibit better data locality. Simulation of each…
The main objective of this paper is to improve the communication costs in distributed quantum circuits. To this end, we present a method for generating distributed quantum circuits from monolithic quantum circuits in such a way that communication between partitions of a distributed quantum circuit is minimized. Thus, the communication between distributed components is performed at a lower cost. Compared to existing works, our approach can effectively map a quantum circuit into an appropriate number of distributed components. Since teleportation is usually the protocol used to connect component…
A general theory is presented for the treatment of decoherence of a multilevel quantum system (with many degrees of freedom) interacting with multi-bath reservoir and driven by ac fields. In this approach, the system is described by a reduced density operator and the multi-bath reservoir is characterized by a number of spectral densities. The reduced density operator is governed by the master equation in which the effect of ac driving fields and the leakage to non-computational states are included. The theory is applied to the study of decoherence of a two-dimensional (2D) SQUID flux qubit cou…
We develop a procedure for distilling magic states used in universal quantum computing that requires substantially fewer initial resources than prior schemes. Our distillation circuit is based on a family of concatenated quantum codes that possess a transversal Hadamard operation, enabling each of these codes to distill the eigenstate of the Hadamard operator. A crucial result of this design is that low-fidelity magic states can be consumed to purify other high-fidelity magic states to even higher fidelity, which we call "multilevel distillation." When distilling in the asymptotic regime of in…
Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as an important issue in terms of technological implementation for quantum computation. The objective is to obtain a LNN architecture with minimum gate cost. As achieving optimal synthesis is a hard problem, heuristic methods have been proposed in recent literature. In this work we present a graph partitioning based approach for LNN synthesis with reduction in circuit cost. In particular, the number of SWAP gates required to convert a given gate-level quantum circuit to its equivalent LNN configuration is minimized. Our…
Quantum circuit partition as a maze: emerging percolation transition via path finding
Università degli Studi di Milano（米兰大学）；Istituto di Fotonica e Nanotecnologie, Consiglio Nazionale delle Ricerche（意大利国家研究委员会光子与纳米技术研究所）；Forschungszentrum Jülich（于利希研究中心）；University of Cologne（科隆大学）；Jülich Supercomputing Centre（于利希超级计算中心）
Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahe…
Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates into consideration. Our algorithm re-synthesizes quantum circuits composed of Clifford group and T gates, the latter being typically the most costly gate in fault-tolerant models, e.g., those based on the Steane or surface codes, with the purpose of minimizing both T-count and T-depth. A major feature of the algorithm is the ability t…
We consider the single photon transistor in coupled cavity system of resonators interacting with multilevel superconducting artificial atom simultaneously. Effective single mode transformation is used for the diagonalization of the the hamiltonian and impedance matching in terms of the normal modes. Storage and transmission of the incident field are described by the interactions between the cavities controlling the atomic transitions of lowest lying states. Rabi splitting of vacuum induced multiphoton transitions is considered in input/output relations by the quadrature operators in the absenc…
Universidad de Santiago de Chile (USACH)（智利圣地亚哥大学）；Center for the Development of Nanoscience and Nanotechnology（纳米科学与纳米技术发展中心）；University of the Basque Country UPV/EHU（巴斯克大学）；IKERBASQUE, Basque Foundation for Science（伊克尔巴斯克巴斯克科学基金会）；Shanghai University（上海大学）
We propose a protocol to perform quantum reinforcement learning with quantum technologies. At variance with recent results on quantum reinforcement learning with superconducting circuits, in our current protocol coherent feedback during the learning process is not required, enabling its implementation in a wide variety of quantum systems. We consider diverse possible scenarios for an agent, an environment, and a register that connects them, involving multiqubit and multilevel systems, as well as open-system dynamics. We finally propose possible implementations of this protocol in trapped ions …
We consider a class of random quantum circuits where at each step a gate from a universal set is applied to a random pair of qubits, and determine how quickly averages of arbitrary finite-degree polynomials in the matrix elements of the resulting unitary converge to Haar measure averages. This is accomplished by establishing an exact mapping between the superoperator that describes t-order moments on n qubits and a multilevel SU(4^t) Lipkin-Meshkov-Glick Hamiltonian. For arbitrary fixed t, we find that the spectral gap scales as 1/n in the thermodynamic limit. Our results imply that random qua…
Development of resource-friendly quantum algorithms remains highly desirable for noisy intermediate-scale quantum computing. Based on the variational quantum eigensolver (VQE) with unitary coupled cluster ansatz, we demonstrate that partitioning of the Hilbert space made possible by the point group symmetry of the molecular systems greatly reduces the number of variational operators by confining the variational search within a subspace. In addition, we found that instead of including all subterms for each excitation operator, a single-term representation suffices to reach required accuracy for…
Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore's law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this paper, we advocate the use of mult…
We propose an efficient algorithm for partitioning Pauli strings into subgroups, which can be simultaneously measured in a single quantum circuit. Our partitioning algorithm drastically reduces the total number of measurements in a variational quantum eigensolver for a quantum chemistry, one of the most promising applications of quantum computing. The algorithm is based on the Ising model optimization problem, which can be quickly solved using an Ising machine. We develop an algorithm that is applicable to problems with sizes larger than the maximum number of variables that an Ising machine ca…
We study numerically the onset of higher-level excitations and resonance frequency shifts in the generalized multilevel Rabi model with dispersive coupling under strong driving. The response to a weak probe is calculated using the Floquet method, which allows us to calculate the probe spectrum and extract the resonance frequency. We test our predictions using a superconducting circuit consisting of transmon coupled capacitively to a coplanar waveguide resonator. This system is monitored by a weak probe field, and at the same time driven at various powers by a stronger microwave tone. We show t…
Superconducting circuits are currently developed as a versatile platform for the exploration of many-body physics, by building on non-linear elements that are often idealized as two-level qubits. A classic example is given by a charge qubit that is capacitively coupled to a transmission line, which leads to the celebrated spin-boson description of quantum dissipation. We show that the intrinsic multilevel structure of superconducting qubits drastically restricts the validity of the spin-boson paradigm due to phase localization, which spreads the wavefunction over many charge states. Numerical …
Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum machines. VQE aims to approximate the lowest eigenvalue of an exponentially sized matrix in polynomial time. It minimizes quantum resource requirements both by co-processing with a classical processor and by structuring computation into many subproblems. Each quantum subproblem involves a separate state preparation terminated by the measurement of one Pauli string. However, the number of such Pauli strings scales as $N^4$ for typical problems of interest--a daunting growth rate that poses a serious li…
