A Tensor Network based Decision Diagram for Representation of Quantum Circuits

• URL: http://arxiv.org/abs/2009.02618v2
• Date: Sat, 21 Aug 2021 07:15:23 GMT
• Title: A Tensor Network based Decision Diagram for Representation of Quantum Circuits
• Authors: Xin Hong, Xiangzhen Zhou, Sanjiang Li, Yuan Feng, Mingsheng Ying
• Abstract summary: This paper proposes a decision diagram style data structure, called TDD, for principled and convenient applications of tensor networks. By exploiting circuit partition, the TDD of a quantum circuit can be computed efficiently. It is expected that TDDs will play an important role in various design automation tasks related to quantum circuits.
• Score: 8.36229449571485
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Tensor networks have been successfully applied in simulation of quantum physical systems for decades. Recently, they have also been employed in classical simulation of quantum computing, in particular, random quantum circuits. This paper proposes a decision diagram style data structure, called TDD (Tensor Decision Diagram), for more principled and convenient applications of tensor networks. This new data structure provides a compact and canonical representation for quantum circuits. By exploiting circuit partition, the TDD of a quantum circuit can be computed efficiently. Furthermore, we show that the operations of tensor networks essential in their applications (e.g., addition and contraction), can also be implemented efficiently in TDDs. A proof-of-concept implementation of TDDs is presented and its efficiency is evaluated on a set of benchmark quantum circuits. It is expected that TDDs will play an important role in various design automation tasks related to quantum circuits, including but not limited to equivalence checking, error detection, synthesis, simulation, and verification.

Related papers

• Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks [2.0257616108612373]
  Quantum walks are powerful tools for various graph-based applications. We present a circuit design for implementing discrete-time quantum walks on complex networks.
  arXiv  Detail & Related papers  (2024-08-28T09:11:47Z)
• 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)
• KetGPT -- Dataset Augmentation of Quantum Circuits using Transformers [1.236829197968612]
  Quantum algorithms, represented as quantum circuits, can be used as benchmarks for assessing the performance of quantum systems. Random circuits are, however, not representative benchmarks as they lack the inherent properties of real quantum algorithms. This research aims to enhance the existing quantum circuit datasets by generating what we refer to as realistic-looking' circuits.
  arXiv  Detail & Related papers  (2024-02-20T20:02:21Z)
• Classical Half-Adder using Trapped-ion Quantum Bits: Towards Energy-efficient Computation [0.43981305860983716]
  Reversible computation has been proposed as a future paradigm for energy efficient computation. We provide a proof-of-principle of classical logical gates running on quantum technologies. We analyse the energy required to operate the logic gates, both theoretically and experimentally.
  arXiv  Detail & Related papers  (2022-10-19T11:23:18Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Simulation Paths for Quantum Circuit Simulation with Decision Diagrams [72.03286471602073]
  We study the importance of the path that is chosen when simulating quantum circuits using decision diagrams. We propose an open-source framework that allows to investigate dedicated simulation paths.
  arXiv  Detail & Related papers  (2022-03-01T19:00:11Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Realizing Quantum Convolutional Neural Networks on a Superconducting Quantum Processor to Recognize Quantum Phases [2.1465372441653354]
  Quantum neural networks tailored to recognize specific features of quantum states by combining unitary operations, measurements and feedforward promise to require fewer measurements and to tolerate errors. We realize a quantum convolutional neural network (QCNN) on a 7-qubit superconducting quantum processor to identify symmetry-protected topological phases of a spin model characterized by a non-zero string order parameter. We find that, despite being composed of finite-fidelity gates itself, the QCNN recognizes the topological phase with higher fidelity than direct measurements of the string order parameter for the prepared states.
  arXiv  Detail & Related papers  (2021-09-13T12:32:57Z)
• 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)
• Model Checking for Verification of Quantum Circuits [1.1878820609988696]
  We will describe a framework for assertion-based verification of quantum circuits. Quantum assertions are specified by a temporal extension of Birkhoff-von Neumann quantum logic. Algorithms for reachability analysis and model checking of quantum circuits are developed based on contraction of tensor networks.
  arXiv  Detail & Related papers  (2021-04-23T00:43:37Z)

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.