Small-world complex network generation on a digital quantum processor

• URL: http://arxiv.org/abs/2111.00167v1
• Date: Sat, 30 Oct 2021 03:55:45 GMT
• Title: Small-world complex network generation on a digital quantum processor
• Authors: Eric B. Jones, Logan E. Hillberry, Matthew T. Jones, Mina Fasihi, Pedram Roushan, Zhang Jiang, Alan Ho, Charles Neill, Eric Ostby, Peter Graf, Eliot Kapit and Lincoln D. Carr
• Abstract summary: We demonstrate the first experimental realization of quantum cellular automata on a digital quantum processor. We calculate population dynamics and complex network measures indicating the formation of small-world mutual information networks. Such computations may open the door to the employment of QCA in applications like the simulation of strongly-correlated matter.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. For instance, Goldilocks QCA depending on trade-off principles exhibit non-equilibrating coherent dynamics and generate complex mutual information networks, much like the brain. The inability of classical computers to simulate large quantum systems is a hindrance to understanding the physics of quantum cellular automata, but quantum computers offer an ideal simulation platform. Here we demonstrate the first experimental realization of QCA on a digital quantum processor, simulating a one-dimensional Goldilocks rule on chains of up to 23 superconducting qubits. Employing low-overhead calibration and error mitigation techniques, we calculate population dynamics and complex network measures indicating the formation of small-world mutual information networks. Unlike random states, these networks decohere at fixed circuit depth independent of system size; the largest of which corresponds to 1,056 two-qubit gates. Such computations may open the door to the employment of QCA in applications like the simulation of strongly-correlated matter or beyond-classical computational demonstrations.

Related papers

• Quantum Embedding of Non-local Quantum Many-body Interactions in Prototypal Anti-tumor Vaccine Metalloprotein on Near Term Quantum Computing Hardware [4.8962578963959675]
  We present for the first time a quantum computer model simulation of a complex hemocyanin molecule. Hemocyanin is an important respiratory protein involved in various physiological processes. We conclude that the magnetic structure of hemocyanin is largely influenced by the many-body correction.
  arXiv  Detail & Related papers  (2024-10-16T16:49:42Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Measurement-based infused circuits for variational quantum eigensolvers [1.732837834702512]
  Variational quantum eigensolvers (VQEs) are successful algorithms for studying physical systems on quantum computers. In this work, we incorporate such ideas into traditional VQE circuits. We showcase our approach on real superconducting quantum computers by performing VQE simulations of testbed systems.
  arXiv  Detail & Related papers  (2023-05-30T16:45:54Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Characterizing a non-equilibrium phase transition on a quantum computer [0.0]
  We use the Quantinuum H1-1 quantum computer to realize a quantum extension of a simple classical disease spreading process. We are able to implement large instances of the model with $73$ sites and up to $72$ circuit layers. This work demonstrates how quantum computers capable of mid-circuit resets, measurements, and conditional logic enable the study of difficult problems in quantum many-body physics.
  arXiv  Detail & Related papers  (2022-09-26T17:59:06Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.