Multi-stage tomography based on eigenanalysis for high-dimensional dense unitary quantum processes

• URL: http://arxiv.org/abs/2407.13542v1
• Date: Thu, 18 Jul 2024 14:18:23 GMT
• Title: Multi-stage tomography based on eigenanalysis for high-dimensional dense unitary quantum processes
• Authors: Yannick Deville, Alain Deville,
• Abstract summary: Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a quantum process. We consider unitary, possibly dense (i.e. without sparsity constraints) processes, which corresponds to isolated systems. We first propose two-stage methods and we then extend them to dichotomic methods, whose number of stages increases with the considered state space dimension.
• Score: 2.5966580648312223
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a quantum process. QPT is a major quantum information processing tool, since it especially allows one to experimentally characterize the actual behavior of quantum gates, that may be used as the building blocks of quantum computers. We here consider unitary, possibly dense (i.e. without sparsity constraints) processes, which corresponds to isolated systems. Moreover, we aim at developing QPT methods that are applicable to a significant number of qubits and hence to a high state space dimension, which allows one to tackle more complex problems. Using the unitarity of the process allows us to develop methods that first achieve part of QPT by performing an eigenanalysis of the estimated density matrix of a process output. Building upon this idea, we first develop a class of complete algorithms that are single-stage, i.e. that use only one eigendecomposition. We then extend them to multiple-stage algorithms (i.e. with several eigendecompositions), in order to address high-dimensional state spaces while being less limited by the estimation errors made when using an arbitrary given Quantum State Tomography (QST) algorithm as a building block of our overall methods. We first propose two-stage methods and we then extend them to dichotomic methods, whose number of stages increases with the considered state space dimension. The relevance of our methods is validated by means of simulations. Single-stage and two-stage methods first yield the following results. Just running them with standard PC and software already makes it possible to evaluate their performance for up to 13 qubits, i.e. with state space dimensions up to a few thousands. This shows their attractiveness in terms of accuracy and proves that they solve the core of the dense QPT problem in a very limited time frame. For other test results, see the paper.

Related papers

• QuIP: 2-Bit Quantization of Large Language Models With Guarantees [44.212441764241]
  This work studies post-training parameter quantization in large language models (LLMs) We introduce quantization with incoherence processing (QuIP), a new method based on the insight that quantization benefits from $textitincoherent$ weight and Hessian matrices.
  arXiv  Detail & Related papers  (2023-07-25T07:44:06Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Quantum Sparse Coding [5.130440339897477]
  We develop a quantum-inspired algorithm for sparse coding. The emergence of quantum computers and Ising machines can potentially lead to more accurate estimations. We conduct numerical experiments with simulated data on Lightr's quantum-inspired digital platform.
  arXiv  Detail & Related papers  (2022-09-08T13:00:30Z)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Variational determination of arbitrarily many eigenpairs in one quantum circuit [8.118991737495524]
  A variational quantum eigensolver (VQE) was first introduced for computing ground states. We propose a new algorithm to determine many low energy eigenstates simultaneously. Our algorithm reduces significantly the complexity of circuits and the readout errors.
  arXiv  Detail & Related papers  (2022-06-22T13:01:37Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization [0.18374319565577155]
  We analyze and optimize the resources required to implement two first quantized quantum algorithms for chemistry. We demonstrate that our qubitized algorithm often requires much less surface code spacetime volume for simulating millions of plane waves than the best second quantized algorithms.
  arXiv  Detail & Related papers  (2021-05-26T18:06:33Z)
• Experimental characterization of quantum processes: a selective and efficient method in arbitrary finite dimension [0.0]
  We show how to implement an algorithm to selectively and efficiently estimate any parameter characterizing a quantum process in a non-prime power dimension. We conducted for the first time an experimental verification of the algorithm in a Hilbert space of dimension $d=6$.
  arXiv  Detail & Related papers  (2020-11-16T19:14:56Z)

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.