Embedding of Tree Tensor Networks into Shallow Quantum Circuits
- URL: http://arxiv.org/abs/2501.18856v1
- Date: Fri, 31 Jan 2025 02:38:17 GMT
- Title: Embedding of Tree Tensor Networks into Shallow Quantum Circuits
- Authors: Shota Sugawara, Kazuki Inomata, Tsuyoshi Okubo, Synge Todo,
- Abstract summary: This study proposes a method to embed Tree Networks (TTNs) into shallow quantum circuits.
Our numerical results show that embedding TTNs provides better initial quantum circuits than Matrix Product States (MPS)
This study is expected to extend the application of VQAs to two-dimensional systems and those with long-range correlations.
- Score: 0.0
- License:
- Abstract: Variational Quantum Algorithms (VQAs) are being highlighted as key quantum algorithms for demonstrating quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) devices, which are limited to executing shallow quantum circuits because of noise. However, the barren plateau problem, where the gradient of the loss function becomes exponentially small with system size, hinders this goal. Recent studies suggest that embedding tensor networks into quantum circuits and initializing the parameters can avoid the barren plateau. Yet, embedding tensor networks into quantum circuits is generally difficult, and methods have been limited to the simplest structure, Matrix Product States (MPSs). This study proposes a method to embed Tree Tensor Networks (TTNs), characterized by their hierarchical structure, into shallow quantum circuits. TTNs are suitable for representing two-dimensional systems and systems with long-range correlations, which MPSs are inadequate for representing. Our numerical results show that embedding TTNs provides better initial quantum circuits than MPS. Additionally, our method has a practical computational complexity, making it applicable to a wide range of TTNs. This study is expected to extend the application of VQAs to two-dimensional systems and those with long-range correlations, which have been challenging to utilize.
Related papers
- Scalable Parameter Design for Superconducting Quantum Circuits with Graph Neural Networks [1.6442870218029524]
complexity of simulating quantum systems poses challenge to computer-aided design of quantum chips.
We propose a parameter designing algorithm for large-scale superconducting quantum circuits.
Our algorithm achieves notable advantages in efficiency, effectiveness, and scalability.
arXiv Detail & Related papers (2024-11-25T13:04:53Z) - 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) - A joint optimization approach of parameterized quantum circuits with a
tensor network [0.0]
Current intermediate-scale quantum (NISQ) devices remain limited in their capabilities.
We propose the use of parameterized Networks (TNs) to attempt an improved performance of the Variational Quantum Eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2024-02-19T12:53:52Z) - Calibrating the role of entanglement in variational quantum circuits [0.6435156676256051]
Entanglement is a key property of quantum computing that separates it from its classical counterpart.
We systematically probe the role of entanglement in the working of two variational quantum algorithms.
We find that for the MAX-CUT problem solved using QAOA, the fidelity as a function of entanglement is highly dependent on the number of layers.
In the case of QNNs, trained circuits with high test accuracies are underpinned by higher entanglement, with any enforced limitation in entanglement resulting in a sharp decline in test accuracy.
arXiv Detail & Related papers (2023-10-16T23:36:40Z) - 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) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - 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) - 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) - Entanglement Classification via Neural Network Quantum States [58.720142291102135]
In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states.
We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
arXiv Detail & Related papers (2019-12-31T07:40:23Z)
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.