Quantum Network Tomography via Learning Isometries on Stiefel Manifold

• URL: http://arxiv.org/abs/2404.06988v3
• Date: Tue, 27 Aug 2024 16:19:01 GMT
• Title: Quantum Network Tomography via Learning Isometries on Stiefel Manifold
• Authors: Ze-Tong Li, Xin-Lin He, Cong-Cong Zheng, Yu-Qian Dong, Tian Luan, Xu-Tao Yu, Zai-Chen Zhang,
• Abstract summary: We propose an efficient method for quantum network tomography by learning isometries on the Stiefel manifold. As a result, our proposed method exhibits high accuracy and efficiency.
• Score: 7.796175259362575
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Explicit mathematical reconstructions of quantum networks play a significant role in developing quantum information science. However, tremendous parameter requirements and physical constraint implementations have become computationally non-ignorable encumbrances. In this work, we propose an efficient method for quantum network tomography by learning isometries on the Stiefel manifold. Tasks of reconstructing quantum networks are tackled by solving a series of unconstrained optimization problems with significantly fewer parameters. The stepwise isometry estimation shows the capability for providing information of the truncated quantum network while processing the tomography. Remarkably, this method enables the dimension-reduced quantum network tomography by reducing the ancillary dimensions of isometries with bounded error. As a result, our proposed method exhibits high accuracy and efficiency.

Related papers

• Fast Quantum Process Tomography via Riemannian Gradient Descent [3.1406146587437904]
  Constrained optimization plays a crucial role in the fields of quantum physics and quantum information science. One specific issue is that of quantum process tomography, in which the goal is to retrieve the underlying quantum process based on a given set of measurement data.
  arXiv  Detail & Related papers  (2024-04-29T16:28:14Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Learning the tensor network model of a quantum state using a few single-qubit measurements [0.0]
  The constantly increasing dimensionality of artificial quantum systems demands highly efficient methods for their characterization and benchmarking. Here we present a constructive and numerically efficient protocol which learns a tensor network model of an unknown quantum system.
  arXiv  Detail & Related papers  (2023-09-01T11:11:52Z)
• Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis [31.203764035373677]
  We develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
  arXiv  Detail & Related papers  (2023-07-18T04:51:28Z)
• Multi-qubit State Tomography with Few Pauli Measurements [8.611891055029076]
  A characterization tool, Quantum state tomography, reconstructs the density matrix of an unknown quantum state. This is less practical owing to the huge burden of measurements and data processing for large numbers of qubits. We build an efficient framework that requires fewer measurements but yields an expected accuracy.
  arXiv  Detail & Related papers  (2023-05-31T14:10:26Z)
• On quantum backpropagation, information reuse, and cheating measurement collapse [6.476797054353113]
  We show that parameterized quantum models can train as efficiently as classical neural networks. We introduce an algorithm with foundations in shadow tomography that matches backpropagation scaling in quantum resources.
  arXiv  Detail & Related papers  (2023-05-22T18:00:02Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• 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)
• Optimal and robust experiment design for quantum state tomography of star-topology register [7.160429920294401]
  We study the quantum state tomography of star-topology registers, in which the individual addressability of peripheral spins is infeasible. Our results can help future investigations of quantum systems with constrained ability of quantum control and measurement.
  arXiv  Detail & Related papers  (2022-06-17T06:40:29Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• 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)

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.