IEEE International Conference on Quantum Computing and Engineering (QCE)

Tensor Network-Based Continuous Variable Quantum Circuit Optimization for Preparation of GKP State

Ryutaro Nagai, Takao Tomono

Published Sep 17, 2023• 0 citations

Abstract

Tensor networks are highly promising methods for efficiently simulating quantum systems using classical computers. In recent years, the efficiency of tensor networks has been eagerly harnessed to simulate NISQ devices in the era of quantum supremacy. However, as of now, quantum advantage with NISQ devices has not been clearly demonstrated in practical applications. This provide impetus for us to intensify our effort in fault tolerant quantum computation (FTQC). Various physical systems and schemes for FTQC have been proposed, with GKP encoding in bosonic systems being one such example. The preparation of GKP states serves as an important building block for realizing FTQC with the GKP code. We introduce tensor networks for simulating and optimizing the GKP state preparation circuit. It is known that the generation of approximated GKP states is achievable through photon counting and post-selection applied to properly prepared multimode Gaussian states. However, it requires optimization of numerous circuit parameters, which is typically computationally challenging on classical computers due to the involvement of the photon counting measurement process. We attempt to utilize tensor networks for more efficient parameter optimization. Additionally, we explore further efficient approach in terms of tensor network structure. We propose a multi-cutoff dimension approach combined with a tree tensor network structure.

DOI: 10.1109/qce57702.2023.10294

Related papers

Optimization of non-Gaussian state generation using tensor networks and automatic differentiation

Ryutaro Nagai, Takao Tomono

Tensor networks have been eagerly developed in recent years as a simulation method for quantum computation on classical computers. The efficiency of tensor networks for simulating quantum computation has been shown by solving a task designed for demonstrating quantum computing supremacy. However, such a task is not useful for real application. Therefore, there is the room for research of finding specific applications suitable for exploiting tensor network simulation. As such an application, we propose optimization of circuits to generate non- Gaussian states. Non-Gaussian state is one of the crucial elements for achieving universal continuous variable quantum computation. We consider this problem as a variational optimization of optical circuits to generate desired non-Gaussian states. Tensor networks efficiently simulate the optical circuits, and their compatibility with automatic differentiation provides a heuristic way to optimize the circuits. We propose and report the result of our approach that combines tensor networks and automatic differentiation to perform variational optimization of circuits such that the desired non-Gaussian state is approximately generated. The complexity of contracting tensor networks is scaled by degree of entanglement, so we consider relatively shallow optical circuit. Such a restriction is beneficial for considering devices without error correction method, which are accessible in near-term.

IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 1, 20221 citation

Simulation of Continuous-Variable Quantum Systems with Tensor Network

Ryutaro Nagai, Takao Tomono, Yuichiro Minato

Tensor network is known as a powerful method to simulate quantum computation on a classical computer. Recently, the random quantum circuit used in the demonstration of quantum supremacy by Sycamore quantum computer have been simulated with tensor network method. Compared to the application of tensor networks to Discrete-Variable (DV) quantum computation, there are very few examples of application of tensor network to Continuous-Variable (CV) quantum computation. Therefore, we applied a tensor network structure called Matrix Product States (MPS) to CV quantum computation. Tensor network is expected to be useful for simulating Gaussian Boson Sampling (GBS), which is a promised near-term application of photonic quantum system. We outline the performance of tensor network-based simulation of CV quantum computation in GBS.

IEEE International Conference on Quantum Computing and Engineering (QCE)Oct 1, 20213 citations

Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage

Manuel S. Rudolph, Jacob A. Miller, Danial Motlagh +3 more

While recent breakthroughs have proven the ability of noisy intermediate-scale quantum (NISQ) devices to achieve quantum advantage in classically-intractable sampling tasks, the use of these devices for solving more practically relevant computational problems remains a challenge. Proposals for attaining practical quantum advantage typically involve parametrized quantum circuits (PQCs), whose parameters can be optimized to find solutions to diverse problems throughout quantum simulation and machine learning. However, training PQCs for real-world problems remains a significant practical challenge, largely due to the phenomenon of barren plateaus in the optimization landscapes of randomly-initialized quantum circuits. In this work, we introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for PQCs, which we show significantly improves the trainability and performance of PQCs on a variety of problems. Given a specific optimization task, this method first utilizes tensor network (TN) simulations to identify a promising quantum state, which is then converted into gate parameters of a PQC by means of a high-performance decomposition procedure. We show that this learned initialization avoids barren plateaus, and effectively translates increases in classical resources to enhanced performance and speed in training quantum circuits. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing, and opens up new avenues to harness the power of modern quantum hardware for realizing practical quantum advantage.

arXiv:2208.13673Aug 29, 20227 citations

A joint optimization approach of parameterized quantum circuits with a tensor network

Clara Ferreira Cores, Kaur Kristjuhan, Mark Jones

Despite the advantage quantum computers are expected to deliver when performing simulations compared to their classical counterparts, the current noisy intermediate-scale quantum (NISQ) devices remain limited in their capabilities. The training of parameterized quantum circuits (PQCs) remains a significant practical challenge, exacerbated by the requirement of shallow circuit depth necessary for their hardware implementation. Hybrid methods employing classical computers alongside quantum devices, such as the Variational Quantum Eigensolver (VQE), have proven useful for analyzing the capabilities of NISQ devices to solve relevant optimization problems. Still, in the simulation of complex structures involving the many-body problem in quantum mechanics, major issues remain about the representation of the system and obtaining results which clearly outperform classical computational devices. In this research contribution we propose the use of parameterized Tensor Networks (TNs) to attempt an improved performance of the VQE algorithm. A joint approach is presented where the Hamiltonian of a system is encapsulated into a Matrix Product Operator (MPO) within a parameterized unitary TN hereby splitting up the optimization task between the TN and the VQE. We show that the hybrid TN-VQE implementation improves the convergence of the algorithm in comparison to optimizing randomly-initialized quantum circuits via VQE.

arXiv:2402.12105Feb 19, 20240 citations

The State Preparation of Multivariate Normal Distributions using Tree Tensor Network

Hidetaka Manabe, Yuichi Sano

The quantum state preparation of probability distributions is an important subroutine for many quantum algorithms. When embedding D -dimensional multivariate probability distributions by discretizing each dimension into 2n points, we need a state preparation circuit comprising a total of nD qubits, which is often difficult to compile. In this study, we propose a scalable method to generate state preparation circuits for D -dimensional multivariate normal distributions, utilizing tree tensor networks (TTN). We establish theoretical guarantees that multivariate normal distributions with 1D correlation structures can be efficiently represented using TTN. Based on these analyses, we propose a compilation method that uses automatic structural optimization to find the most efficient network structure and compact circuit. We apply our method to state preparation circuits for various high-dimensional random multivariate normal distributions. The numerical results suggest that our method can dramatically reduce the circuit depth and CNOT count while maintaining fidelity compared to existing approaches.

arXiv:2412.12067QuantumMay 28, 20256 citations

Pre-optimizing variational quantum eigensolvers with tensor networks

Abid Khan, Bryan K. Clark, Norm M. Tubman

The variational quantum eigensolver (VQE) is a promising algorithm for demonstrating quantum advantage in the noisy intermediate-scale quantum (NISQ) era. However, optimizing VQE from random initial starting parameters is challenging due to a variety of issues including barren plateaus, optimization in the presence of noise, and slow convergence. While simulating quantum circuits classically is generically difficult, classical computing methods have been developed extensively, and powerful tools now exist to approximately simulate quantum circuits. This opens up various strategies that limit the amount of optimization that needs to be performed on quantum hardware. Here we present and benchmark an approach where we find good starting parameters for parameterized quantum circuits by classically simulating VQE by approximating the parameterized quantum circuit (PQC) as a matrix product state (MPS) with a limited bond dimension. Calling this approach the variational tensor network eigensolver (VTNE), we apply it to the 1D and 2D Fermi-Hubbard model with system sizes that use up to 32 qubits. We find that in 1D, VTNE can find parameters for PQC whose energy error is within 0.5% relative to the ground state. In 2D, the parameters that VTNE finds have significantly lower energy than their starting configurations, and we show that starting VQE from these parameters requires non-trivially fewer operations to come down to a given energy. The higher the bond dimension we use in VTNE, the less work needs to be done in VQE. By generating classically optimized parameters as the initialization for the quantum circuit one can alleviate many of the challenges that plague VQE on quantum computers.

arXiv:2310.12965Oct 19, 202310 citations