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 quantum circuits. Under reasonable parameter assumptions, a theoretical analysis reveals our classical simulator consumes less runtime than that of near-term quantum processors for most problem instances. Furthermore, we demonstrate the typical all-connected 2D grid instances by moderate FPGA circuits, and show our designed parallel scheme is a practically scalable, high-efficient and operationally convenient tool for simulating and verifying graph-state circuits performed by current quantum hardware.
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…
A Toffoli gate ($C^{n}$-NOT gate) is regarded as an important unitary gate in quantum computation, and is simulated by a quantum circuit composed of $C^{2}$-NOT gates. This paper presents a quantum circuit with a new configuration of $C^{2}$-NOT gates simulating a $C^{2m+1}$-NOT operation under the condition $m=2^{n}$ ($n=1,2,...$). The circuit is composed of units called multi-qubits gates (MQGs), each of which performs $m$ $C^{2}$-NOT operations simultaneously on $3m$ qubits. Simultaneous operations eliminate the need to manipulate qubits individually, as required in conventional quantum cir…
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…
We generalize solid-state tight-binding techniques for the spectral analysis of large superconducting circuits. We find that tight-binding states can be better suited for approximating the low-energy excitations than charge-basis states, as illustrated for the interesting example of the current-mirror circuit. The use of tight binding can dramatically lower the Hilbert space dimension required for convergence to the true spectrum, and allows for the accurate simulation of larger circuits that are out of reach of charge basis diagonalization.
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the protocol can efficiently simulate a large set of multi-qubit mixed states that are not mixtures of stabilizer states. The existence of these 'bound states' was previously only known for odd-dimensional systems like qutrits. The algorithm also has the favorable property that circuits with depolarizing noise are simulated much faster than unitary circuits. Th…
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…
Superconducting quantum circuits is one of the leading candidates for a universal quantum computer. Designing novel qubit and multiqubit superconducting circuits requires the ability to simulate and analyze the properties of a general circuit. In particular, going outside the transmon approach, we cannot make assumptions on anharmonicity, thus precluding blackbox quantization approaches and necessitating the formal circuit quantization approach. We consider and solve two issues involved in simulating general superconducting circuits. One of the issues is the handling of free modes in the circu…
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（滑铁卢大学）
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（苏黎世大学物理系）
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several efficient strong simulation techniques are known for restricted families of quantum circuits and we develop an additional technique in this article. Further, we show that strong simulation algorithms perform another fundamental task: solving search problems. Efficient strong simulation techniques allow solutions to a class of search problems to be counted and found …
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（中国工程物理研究院研究生院）
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)（巴塞罗那自治大学）
Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and active Bogoliubov transformations as effected by a nonlinear amplification medium. As a consequence of the Bloch-Messiah theorem, any Gaussian unitary can be decomposed into a passive interferometer followed by a layer of single-mode squeezers and another passive interferometer. Here, it is shown how to circumvent the need for active transformations. Namely, we provide a technique to simulate sampling fro…
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（柏林亥姆霍兹材料能源中心）
Prior work has shown that there exists a relation problem which can be solved with certainty by a constant-depth quantum circuit composed of geometrically local gates in two dimensions, but cannot be solved with high probability by any classical constant depth circuit composed of bounded fan-in gates. Here we provide two extensions of this result. Firstly, we show that a separation in computational power persists even when the constant-depth quantum circuit is restricted to geometrically local gates in one dimension. The corresponding quantum algorithm is the simplest we know of which achieves…
Simulating quantum circuits with a neural statebank
Materials Research Laboratory, Massachusetts Institute of Technology（麻省理工学院材料研究实验室）；Department of Physics, Harvard University（哈佛大学物理系）；Department of Physics, Massachusetts Institute of Technology（麻省理工学院物理系）
Studying out-of-equilibrium physics in quantum systems under quantum quench is of vast experimental and theoretical interests. Using periodic quantum quenches, we present an experimentally accessible scheme to simulate the quantum Zeno and anti-Zeno effects in an open quantum system of a single superconducting qubit interacting with an array of transmission line resonators. The scheme is based on the following two observations: Firstly, compared with conventional systems, the short-time non-exponential decay in our superconducting circuit system is readily observed; and secondly, a quench-off …
We propose a scheme for simulating 3+1, 2+1, 1+1 Dirac equation for a free spin-1/2 particle with superconducting josephson circuits consisting of five qubits, four qubits, two qubits respectively. In 3+1D and 2+1D, the flux qubit1 driven by a resonant pulse is in the superposition state of its own two eigenstatesis, and it is used as a bus to induce the (blue)red-sideband excitation consisting of a magnetic pulse acting resonantly on two levels of the flux qubit2 and the energy levels of one phase qubit, which yields two (Anti)Jaynes-Cummings interactions with one driving pulse and reduces th…
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（亥姆霍兹柏林材料与能源研究中心）
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum circuits can be classically simulated by expressing the non-stabiliser gates in a circuit as magic state injections and decomposing them in chunks of 2-6 states at a time, obtaining sums of (efficiently-simulable) stabiliser states with many fewer terms than the naive approach. We adapt these techniques from the original setting of Clifford circuits with magic …
Simulation of materials by using quantum processors is envisioned to be a major direction of development in quantum information science. Here we exploit the mathematical analogies between a triangular spin lattice with Dzyaloshinskii-Moriya coupling on one edge and a three-level system driven by three fields in a loop configuation to emulate spin-transport effects. We show that the spin transport efficiency, seen in the three-level system as population transfer, is enhanced when the conditions for superadiabaticity are satisfied. We demonstrate experimentally that phenomena characteristic to s…
We optimise a translationally invariant, sequential quantum circuit on a superconducting quantum device to simulate the groundstate of the quantum Ising model through its quantum critical point. We further demonstrate how the dynamical quantum critical point found in quenches of this model across its quantum critical point can be simulated. Our approach avoids finite-size scaling effects by using sequential quantum circuits inspired by infinite matrix product states. We provide efficient circuits and a variety of error mitigation strategies to implement, optimise and time-evolve these states.
Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to assist the characterization of quantum devices and to train shallow circuits for generative tasks. The procedure leverages quantum hardware capabilities to its fullest extent by using native gates and their qubit connectivity. We demonstrate that our approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states, also known as "cat states…
The numerical simulation of quantum circuits is an indispensable tool for development, verification and validation of hybrid quantum-classical algorithms on near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. We present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable tensor n…
The finite-time isothermal process is fundamental in quantum thermodynamics yet complicated with combination of changing control parameters and the interaction with the thermal bath. Such complexity prevents the direct application of the traditional thermodynamics measurement of the relevant quantities. In this paper, we provide a discrete-step method to separate the work done and the heat exchange in the isothermal process by decomposing the process into piecewise adiabatic and isochoric processes. The piecewise control scheme makes it possible to simulate the whole process on a generic quant…
