Effects of quantum resources on the statistical complexity of quantum circuits
Harvard University（哈佛大学）；Institute of High Performance Computing, Agency for Science, Technology and Research (A*STAR)（新加坡科技研究局高性能计算研究院）；Zhejiang Sci-Tech University（浙江理工大学）；Zhejiang University（浙江大学）
Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo, Yaobo Zhang
We investigate how the addition of quantum resources changes the statistical complexity of quantum circuits by utilizing the framework of quantum resource theories. Measures of statistical complexity that we consider include the Rademacher complexity and the Gaussian complexity, which are well-known measures in computational learning theory that quantify the richness of classes of real-valued functions. We derive bounds for the statistical complexities of quantum circuits that have limited access to certain resources and apply our results to two special cases: (1) stabilizer circuits that are supplemented with a limited number of T gates and (2) instantaneous quantum polynomial-time Clifford circuits that are supplemented with a limited number of CCZ gates. We show that the increase in the statistical complexity of a quantum circuit when an additional quantum channel is added to it is upper bounded by the free robustness of the added channel. Finally, we derive bounds for the generalization error associated with learning from training data arising from quantum circuits.
Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits
Department of Mathematics, McMaster University（麦斯特大学数学系）；Vector Institute（向量研究所）；The London School of Economics and Political Science（伦敦政治经济学院）；University of Vienna, Faculty of Mathematics（维也纳大学数学系）
Harvard University（哈佛大学）；Institute of High Performance Computing, Agency for Science, Technology and Research (A*STAR)（新加坡科技研究局（A*STAR）高性能计算研究所）；Zhejiang Sci-Tech University（浙江理工大学）；Zhejiang University（浙江大学）
In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical complexity, namely the Rademacher complexity, to the quantum circuit model in quantum computation and study how the statistical complexity depends on various quantum circuit parameters. In particular, we investigate the dependence of the statistical complexity on the resources, depth, width, and the number of input and output registers of a quantum circuit. To study how the statistical complexity scales with resourc…
We present QEst, a procedure to systematically generate approximations for quantum circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for scalability with procedures to 1) reduce circuit length using approximate synthesis, 2) improve fidelity by running circuits that represent key samples in the approximation space, and 3) reason about approximation upper bound. Our evaluation results indicate that our approach of "dissimilar" approximations provides close fidelity to the original circuit. Overall, the results indicate that QEst can reduce CNOT gate count by 30…
Noise Correlations as a Resource in Pauli-Twirled Circuits
Pritzker School of Molecular Engineering, University of Chicago（芝加哥大学普里茨克分子工程学院）；Department of Physics and Astronomy, Northwestern University（西北大学物理与天文系）；National Center for Computational Sciences, Oak Ridge National Laboratory（橡树岭国家实验室国家计算科学中心）；IBM Quantum, IBM T.J. Watson Research Center（IBM量子，IBM T.J.沃森研究中心）
Resource generation and dynamical complexities in open random quantum circuits
Harish-Chandra Research Institute（哈里什-钱德拉研究所）；Homi Bhabha National Institute（霍米·巴巴国立研究所）；Indian Institute of Technology (ISM) Dhanbad（印度理工学院（ISMT）丹巴德分校）
The first generations of quantum computers will execute fault-tolerant quantum circuits, and it is very likely that such circuits will use surface quantum error correcting codes. To the best of our knowledge, no complete design automation tool for such circuits is currently available. This is to a large extent because such circuits have three dimensional layouts (e.g. two dimensional hardware and time axis as a third dimension) and their optimisation is still ongoing research. This work introduces SurfBraid, a tool for the automatic design of surface code protected quantum circuits -- it inclu…
Quantum resource analysis is crucial for designing quantum circuits as well as assessing the viability of arbitrary (error-corrected) quantum computations. To this end, we introduce QUANTIFY, which is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind, and it includes the necessary methods to handle Toffoli+H and more generalised controlled quantum gates, too. Key features of QUANTIFY include: (1) analysis and optimisation methods which are compatible with the surface code, (2) choice between …
Quantum cloud computing is a promising paradigm for efficiently provisioning quantum resources (i.e., qubits) to users. In quantum cloud computing, quantum cloud providers provision quantum resources in reservation and on-demand plans for users. Literally, the cost of quantum resources in the reservation plan is expected to be cheaper than the cost of quantum resources in the on-demand plan. However, quantum resources in the reservation plan have to be reserved in advance without information about the requirement of quantum circuits beforehand, and consequently, the resources are insufficient,…
Entanglement-assisted circuit knitting: Distributed quantum computing using limited entanglement resources
National Tsing Hua University（国立清华大学）；National Cheng Kung University（国立成功大学）；Tamkang University（淡江大学）；Hon Hai Research Institute（鸿海研究院）；National Center for Theoretical Sciences（国家理论科学中心）
Reducing Circuit Resources in Grover's Algorithm via Constraint-Aware Initialization
Electronics and Telecommunications Research Institute（电子电信研究所）；Center for Quantum Technology, Korea Institute of Science and Technology（韩国科学技术院量子技术中心）；Department of Mathematics and Research Institute for Basic Sciences, Kyung Hee University（庆熙大学数学系与基础科学研究所）；Center for Quantum Information R&D, Korea Institute of Science and Technology Information（韩国科学技术信息中心量子信息研发中心）
Variational quantum algorithms (VQAs) are promising methods to demonstrate quantum advantage on near-term devices as the required resources are divided between a quantum simulator and a classical optimizer. As such, designing a VQA which is resource-efficient and robust against noise is a key factor to achieve potential advantage with the existing noisy quantum simulators. It turns out that a fixed VQA circuit design, such as the widely-used hardware efficient ansatz, is not necessarily robust against imperfections. In this work, we propose a genome-length-adjustable evolutionary algorithm to …
Understanding how a stabilizer circuit responds to different input is important to formulating an effective strategy for resource management. In this paper, we further investigate the many ways of using stabilizer operations to generate a single qubit output from a two-qubit state. In particular, by restricting the input to certain product states, we discover probabilistic operations capable of transforming stabilizer circuit outputs back into stabilizer circuit inputs. These secondary operations are ideally suited for recovery purposes and require only one extra resource ancilla to succeed. A…
Generative AI Beyond Tokens: Quantum Resource Consumption of IQP Circuits
Technical University of Applied Sciences Regensburg（雷根斯堡应用技术大学）；Universität der Bundeswehr München（联邦国防军慕尼黑大学）；Siemens AG, Foundational Technology（西门子股份公司基础技术部门）
In measurement-based quantum computation (MBQC), elementary quantum operations can be more parallelized than the quantum circuit model by employing a larger Hilbert space of graph states used as the resource. Thus MBQC can be regarded as a method of quantum computation where the temporal resource described by the depth of quantum operations can be reduced compared to the quantum circuit model by using the extra spatial resource described by graph states. To analyze the trade-off relationship of the spatial and temporal resources, we consider a method to obtain quantum circuit decompositions of…
Random quantum circuits are proficient information scramblers and efficient generators of randomness, rapidly approximating moments of the unitary group. We study the convergence of local random quantum circuits to unitary $k$-designs. Employing a statistical mechanical mapping, we give an exact expression of the distance to forming an approximate design as a lattice partition function. In the statistical mechanics model, the approach to randomness has a simple interpretation in terms of domain walls extending through the circuit. We analytically compute the second moment, showing that random …
We provide evidence that commonly held intuitions when designing quantum circuits can be misleading. In particular we show that: a) reducing the T-count can increase the total depth; b) it may be beneficial to trade CNOTs for measurements in NISQ circuits; c) measurement-based uncomputation of relative phase Toffoli ancillae can make up to 30\% of a circuit's depth; d) area and volume cost metrics can misreport the resource analysis. Our findings assume that qubits are and will remain a very scarce resource. The results are applicable for both NISQ and QECC protected circuits. Our method uses …
University of Toronto（多伦多大学）；Vector Institute for Artificial Intelligence（矢量人工智能研究院）；Canadian Institute for Advanced Research（加拿大高等研究院）
As we continue to find applications where the currently available noisy devices exhibit an advantage over their classical counterparts, the efficient use of quantum resources is highly desirable. The notion of quantum autoencoders was proposed as a way for the compression of quantum information to reduce resource requirements. Here, we present a strategy to design quantum autoencoders using evolutionary algorithms for transforming quantum information into lower-dimensional representations. We successfully demonstrate the initial applications of the algorithm for compressing different families …
We show that the density-matrix states of noncomposite qudit systems satisfy entropic and information relations like the subadditivity condition, strong subadditivity condition, and Araki--Lieb inequality, which characterize hidden quantum correlations of observables associated with these indivisible systems. We derive these relations employing a specific map of the entropic inequalities known for density matrices of multiqudit systems to the inequalities for density matrices of single-qudit systems. We present the obtained relations in the form of mathematical inequalities for arbitrary Hermi…
Quantum algorithms need to be compiled to respect the constraints imposed by quantum processors, which is known as the mapping problem. The mapping procedure will result in an increase of the number of gates and of the circuit latency, decreasing the algorithm's success rate. It is crucial to minimize mapping overhead, especially for Noisy Intermediate-Scale Quantum (NISQ) processors that have relatively short qubit coherence times and high gate error rates. Most of prior mapping algorithms have only considered constraints such as the primitive gate set and qubit connectivity, but the actual g…
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…
In this work, we provide an overview of circuits for quantum computing. We introduce gates used in quantum computation and then present resource cost measurements used to evaluate circuits made from these gates. We then illustrate how the gates shown are then combined into quantum circuits for basic arithmetic functions. Architectures for addition, subtraction, multiplication, and division are shown. We demonstrate how to calculate the resource costs of quantum circuits. We conclude this overview with by illustrating an application of the elementary quantum circuits for the image rotation oper…
We extend the ability of unitary quantum circuits by interfacing it with classical autoregressive neural networks. The combined model parametrizes a variational density matrix as a classical mixture of quantum pure states, where the autoregressive network generates bitstring samples as input states to the quantum circuit. We devise an efficient variational algorithm to jointly optimize the classical neural network and the quantum circuit for quantum statistical mechanics problems. One can obtain thermal observables such as the variational free energy, entropy, and specific heat. As a by produc…
We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev. Lett. 103, 150502 (2009)] including the recently described elaborations [Phys. Rev. Lett. 110, 250504 (2013)]. Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width, circuit depth, the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set {X, Y, Z, H, …
The efficient decomposition of multi-controlled gates is a significant factor in quantum compiling, both in circuit depth and T-gate count. Recent work has demonstrated that qudits have the potential to reduce resource requirements from linear to logarithmic depth and to avoid fractional phase rotations. Here we argue, based on the scaling of decoherence in high-index states, that circuit depth is not the primary factor, and that both the choice of entangling gate and interaction network topology act together to determine the spread of errors and ultimate failure rate in a circuit. We further …
Centre for Quantum Technologies（量子技术中心）；Institute for Quantum Computing and Quantum Technologies, NCSR Demokritos（德谟克利特国家科学研究中心量子计算与量子技术研究所）；School of Electronics and Computer Science, University of Southampton（南安普顿大学电子与计算机科学学院）；AngelQ Quantum Computing（AngelQ量子计算）
Historically, noise in superconducting circuits has been considered an obstacle to be removed. A large fraction of the research effort in designing superconducting circuits has focused on noise reduction, with great success, as coherence times have increased by four orders of magnitude in the past two decades. However, noise and dissipation can never be fully eliminated, and further, a rapidly growing body of theoretical and experimental work has shown that carefully tuned noise, in the form of engineered dissipation, can be a profoundly useful tool in designing and operating quantum circuits.…
Fault-tolerant quantum computation (FTQC) schemes using large block codes that encode $k>1$ qubits in $n$ physical qubits can potentially reduce the resource overhead to a great extent because of their high encoding rate. However, the fault-tolerant (FT) logical operations for the encoded qubits are difficult to find and implement, which usually takes not only a very large resource overhead but also long $\textit{in-situ}$ computation time. In this paper, we focus on Calderbank-Shor-Steane $[\![ n,k,d ]\!]$ (CSS) codes and their logical FT Clifford circuits. We show that the depth of an arbitr…
We consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Clifford operators. This introduces a nesting, $C_1^2 \subset C_2^4 \subset C_3^2$, where $C_n^m$ is the $n$th level of the $m$-dimensional qudit Clifford hierarchy. If we can convert between logical qubits and qudits, then qudit Clifford operators are qubit non-Clifford operators. Conversion is achieved by qubit fusion and qudit fission using stabilizer circuits that consume a resource state. This resource is a fused qubit stabilizer state with a fault-tolerant state preparation using stabilizer circui…
A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics
University of Maryland, College Park（马里兰大学帕克分校）；Electrical & Computer Engineering Department, UCLA（加州大学洛杉矶分校电气与计算机工程系）；Department of Electrical and Computer Engineering, Princeton University（普林斯顿大学电气与计算机工程系）；QuEra Computing Inc.（QuEra计算公司）；Department of Physics, Stanford University（斯坦福大学物理系）
Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement
SKKU Advanced Institute of Nanotechnology (SAINT), Sungkyunkwan University（成均馆大学 SKKU 纳米技术高级研究所 (SAINT)）；Okinawa Institute of Science and Technology Graduate University（冲绳科学技术大学院大学）；Department of Chemistry, Yonsei University（延世大学化学系）；Department of Quantum Information, Yonsei University（延世大学量子信息系）；Department of Computational Science and Engineering, Yonsei University（延世大学计算科学与工程系）
We present a general technique for deterministic implementation of a multi-mode nonlinear coupling between several propagating microwave or optical modes in quantum circuits. The measurement induced technique combines specifically prepared resource states together with feasible feed-forward operations. We explore several ways of generating the suitable resource states and discuss their difference on an illustrative example of cubic coupling between two modes. We also show that the required entangled states with requisite nonlinear properties can be already generated in the present day experime…
