We prepare two dimensional states generated by shallow circuits composed of (1) one layer of two-qubit CZ gate or (2) a few layers of two-qubit random Clifford gate. After measuring all of the bulk qubits, we study the entanglement structure of the remaining qubits on the one dimensional boundary. In the first model, we observe that the competition between the bulk X and Z measurements can lead to an entanglement phase transition between an entangled volume law phase and a disentangled area law phase. We numerically evaluate the critical exponents and generalize this idea to other qudit systems with local Hilbert space dimension larger than 2. In the second model, we observe the entanglement transition by varying the density of the two-qubit gate in each layer. We give an interpretation of this transition in terms of random bond Ising model in a similar shallow circuit composed of random Haar gates.
Multipartite entanglement is of important resources for quantum communication and quantum computation. Our goal in this paper is to characterize general multipartite entangled states according to shallow quantum circuits. We firstly prove any genuinely multipartite entanglement on finite-dimensional spaces can be generated by using 2-layer shallow quantum circuit consisting of two biseparable quantum channels, which the smallest nontrivial circuit depth in the shallow quantum circuit model. We further propose a semi-device-independent entanglement model depending on the local connection abilit…
We prove that a classical computer can efficiently sample from the photon-number probability distribution of a Gaussian state prepared by using an optical circuit that is shallow and local. Our work generalizes previous known results for qubits to the continuous-variable domain. The key to our proof is the observation that the adjacency matrices characterizing the Gaussian states generated by shallow and local circuits have small bandwidth. To exploit this structure, we devise fast algorithms to calculate loop hafnians of banded matrices. Since sampling from deep optical circuits with exponent…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random gates, approximate simulation of typical instances is almost as hard as exact simulation. We prove that this is not the case by exhibiting a shallow circuit family with uniformly random gates that cannot be efficiently classically simulated near-exactly under standard hardness assumptions, but can be simulated approximately for all but a superpolynomially small…
Clifford circuits are insufficient for universal quantum computation or creating $t$-designs with $t\ge 4$. While the entanglement entropy is not a telltale of this insufficiency, the entanglement spectrum is: the entanglement levels are Poisson-distributed for circuits restricted to the Clifford gate-set, while the levels follow Wigner-Dyson statistics when universal gates are used. In this paper we show, using finite-size scaling analysis of different measures of level spacing statistics, that in the thermodynamic limit, inserting a single T $(π/8)$ gate in the middle of a random Clifford ci…
Conditional dependence and Scrooge ensembles in shallow random quantum circuits
University of Waterloo（滑铁卢大学）；TCM Group, Cavendish Laboratory, University of Cambridge（剑桥大学卡文迪许实验室 TCM 组）；Walter Burke Institute for Theoretical Physics and Institute for Quantum Information and Matter, California Institute of Technology（加州理工学院理论物理沃尔特·伯克研究所与量子信息物质研究所）；Google Quantum AI（谷歌量子人工智能）；Perimeter Institute for Theoretical Physics（理论物理珀米特研究所）
We present two results on the subject of quantum contextuality and cohomology, and non-locality and quantum advantage with shallow circuits. Abramsky et al. showed that a range of examples of quantum contextuality is detected by a cohomological invariant based on Čech cohomology. However, the approach does not give a complete cohomological characterisation of contextuality. A different cohomological approach to contextuality was introduced by Okay et al. Their approach exploits the algebraic structure of the Pauli operators and their qudit generalisations known as Weyl operators. We give an ab…
Quantum critical point is one key concept for studying many-body physics but its investigation may be resource-demanding even for a quantum computer due to the intrinsic complexity. In this paper, we propose an approach based on variational quantum eigensolver(VQE), dubbed as Delta-VQE, for locating the quantum critical point using only shallow quantum circuits. With Delta-VQE, the critical point can be identified as a most confusing point, quantified as zero difference between two variational energies that use two representative reference states of distinct phases of matter. Remarkably, the s…
Recently, constant-depth quantum circuits are proved more powerful than their classical counterparts at solving certain problems, e.g., the two-dimensional (2D) hidden linear function (HLF) problem regarding a symmetric binary matrix. To further investigate the boundary between classical and quantum computing models, in this work we propose a high-performance two-stage classical scheme to solve a full-sampling variant of the 2D HLF problem, which combines traditional classical parallel algorithms and a gate-based classical circuit model together for exactly simulating the target shallow quantu…
The Quantum Approximate Optimization Algorithm (QAOA), which is a variational quantum algorithm, aims to give sub-optimal solutions of combinatorial optimization problems. It is widely believed that QAOA has the potential to demonstrate application-level quantum advantages in the noisy intermediate-scale quantum(NISQ) processors with shallow circuit depth. Since the core of QAOA is the computation of expectation values of the problem Hamiltonian, an important practical question is whether we can find an efficient classical algorithm to solve quantum mean value in the case of general shallow qu…
We focus on the depth optimization of CNOT circuits on hardwares with limited connectivity. We adapt the algorithm from Kutin et al. that implements any $n$-qubit CNOT circuit in depth at most $5n$ on a Linear Nearest Neighbour (LNN) architecture. Our proposal is a block version of Kutin et al.'s algorithm that is scalable with the number of interactions available in the hardware: the more interactions we have the less the depth. We derive better theoretical upper bounds and we provide a simple implementation of the algorithm. Overall, we achieve better depth complexity for CNOT circuits on so…
An unconditional distribution learning advantage with shallow quantum circuits
Technische Universität Berlin（柏林工业大学）；Freie Universität Berlin（柏林自由大学）；Fraunhofer Heinrich Hertz Institute（弗劳恩霍夫海因里希·赫兹研究所）；Helmholtz-Zentrum Berlin für Materialien und Energie（亥姆霍兹柏林材料与能源研究中心）
A study of the artificial neural network representation of quantum many-body states is presented. The locality and entanglement properties of states for shallow and deep quantum neural networks are investigated in detail. By introducing the notion of local quasi-product states, for which the locally connected shallow feed-forward neural network states and restricted Boltzmann machine states are special cases, we show that Rényi entanglement entropies of all these states obey the entanglement area law. Besides, we also investigate the entanglement features of deep Boltzmann machine states and s…
Sample-efficient benchmarking of shallow all-to-all random quantum circuits
The College of William & Mary（威廉玛丽学院）；The University of Chicago（芝加哥大学）；Joint Center for Quantum Information and Computer Science, University of Maryland and NIST（马里兰大学和NIST联合量子信息与计算中心）；University of Waterloo（滑铁卢大学）
Conservation laws can constrain entanglement dynamics in isolated quantum systems, manifest in a slowdown of higher Rényi entropies. Here, we explore this phenomenon in a class of long-range random Clifford circuits with U$(1)$ symmetry where transport can be tuned from diffusive to superdiffusive. We unveil that the different hydrodynamic regimes reflect themselves in the asymptotic entanglement growth according to $S(t) \propto t^{1/z}$, where the dynamical transport exponent $z$ depends on the probability $\propto r^{-α}$ of gates spanning a distance $r$. For sufficiently small $α$, we show…
Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations
Haiqu, Inc.（海奎公司）；Akhiezer Institute for Theoretical Physics, NSC KIPT（阿赫伊泽尔理论物理研究所，国家核子研究中心基辅物理技术研究所）；V.N. Karazin Kharkiv National University（V.N.卡拉金哈尔科夫国立大学）；HSBC Lab, Emerging Technologies, Innovation & Ventures（汇丰实验室，新兴技术、创新与风险投资部门）；Faculty of Electrical Engineering, Czech Technical University in Prague（捷克布拉格工业大学电气工程学院）；Archimedes Research Unit on AI, Data Science and Algorithms, Athena Research Center（雅典娜研究中心人工智能、数据科学与算法研究组）；HSBC Service Delivery Sp. z o.o.（汇丰服务交付有限公司）；Department of Physics, University of Zürich（苏黎世大学物理系）
We study the growth of genuine multipartite entanglement in random quantum circuit models, which include random unitary circuit models and the random Clifford circuit. We find that for the random Clifford circuit, the growth of multipartite entanglement remains slower in comparison to the random unitary case. However, the final saturation value of multipartite entanglement is almost the same in both cases. The behavior is then compared to the genuine multipartite entanglement obtained in random matrix product states with a moderately high bond dimension. We then relate the behavior of multipar…
Ensemble-learning error mitigation for variational quantum shallow-circuit classifiers
Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China（电子科技大学基础与前沿研究院）；The Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology（香港科技大学电子与计算机工程学系）；Graduate School of China Academy of Engineering Physics（中国工程物理研究院研究生院）
Quantum computers promise to revolutionise electronic simulations by overcoming the exponential scaling of many-electron problems. While electronic wave functions can be represented using a product of fermionic unitary operators, shallow quantum circuits for exact states have not yet been achieved. We construct universal wave functions from gate-efficient, symmetry-preserving fermionic operators by introducing an algorithm that globally optimises the wave function in the discrete ansatz design and the continuous parameter spaces. Our approach maximises the accuracy that can be obtained with ne…
Recently, Bravyi, Gosset, and König (Science, 2018) exhibited a search problem called the 2D Hidden Linear Function (2D HLF) problem that can be solved exactly by a constant-depth quantum circuit using bounded fan-in gates (or QNC^0 circuits), but cannot be solved by any constant-depth classical circuit using bounded fan-in AND, OR, and NOT gates (or NC^0 circuits). In other words, they exhibited a search problem in QNC^0 that is not in NC^0. We strengthen their result by proving that the 2D HLF problem is not contained in AC^0, the class of classical, polynomial-size, constant-depth circuits …
We study entanglement fluctuations and quantum error correction in the weakly monitored volume-law phase of quantum automaton circuits subject to repeated local measurements. We numerically observe that the entanglement entropy exhibits strong fluctuation with the exponent close to the ``growth exponent'' of the Kardar-Parisi-Zhang (KPZ) universality class, the same as other local random circuits studied previously. We also investigate the dynamically generated quantum error correction code in the purification process and show that this model has different contiguous code distances for two typ…
University College Dublin（都柏林大学）；Equal1 Labs（Equal1实验室）
There is increasing interest in the development of gate-based quantum circuits for the training of machine learning models. Yet, little is understood concerning the parameters of circuit design, and the effects of noise and other measurement errors on the performance of quantum machine learning models. In this paper, we explore the practical implications of key circuit design parameters (number of qubits, depth etc.) using several standard machine learning datasets and IBM's Qiskit simulator. In total we evaluate over 6500 unique circuits with $n \approx 120700$ individual runs. We find that i…
Shallow instantaneous quantum polynomial-time circuits for generative modeling on noisy intermediate-scale quantum hardware
Eurecat, Centre Tecnològic de Catalunya（Eurecat，加泰罗尼亚技术中心）；Centre de Visió per Computador (CVC)（计算机视觉中心）；Universitat Autònoma de Barcelona (UAB)（巴塞罗那自治大学）
The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
Sorbonne Université（索邦大学）；CNRS（法国国家科学研究中心）；School of Informatics, University of Edinburgh（爱丁堡大学信息学院）；International Iberian Nanotechnology Laboratory（伊比利亚纳米技术国际实验室）
Measurement-driven quantum advantages in shallow circuits
Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；Helmholtz-Zentrum Berlin für Materialien und Energie（柏林亥姆霍兹材料能源中心）
California Institute of Technology（加州理工学院）；Massachusetts Institute of Technology（麻省理工学院）；Google Quantum AI（谷歌量子人工智能团队）；University of California, Berkeley（加州大学伯克利分校）；University of California, Davis（加州大学戴维斯分校）；Harvard University（哈佛大学）
