Characterizing Gaussian quantum processes with Gaussian resources

• URL: http://arxiv.org/abs/2503.13698v1
• Date: Mon, 17 Mar 2025 20:14:58 GMT
• Title: Characterizing Gaussian quantum processes with Gaussian resources
• Authors: Logan W. Grove, Pratik J. Barge, Kevin Valson Jacob,
• Abstract summary: We develop a method to fully characterize arbitrary Gaussian processes in continuous-variable quantum systems.<n>The method is efficient, involving only $O(N2)$ steps to characterize an $N$-mode system.<n>We observe that heterodyne measurements outperform homodyne measurements for reconstructing Gaussian processes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Characterizing quantum processes is indispensable for the implementation of any task in quantum information processing. In this paper, we develop an efficient method to fully characterize arbitrary Gaussian processes in continuous-variable quantum systems. This is done by directly obtaining all elements of the symplectic matrix that describes the process. Only Gaussian resources such as coherent probes and quadrature measurements are needed for this task. The method is efficient, involving only $O(N^2)$ steps to characterize an $N$-mode system. Further, the method is resilient to uniform loss. We simulate this procedure using the Python package Strawberry Fields. We observe that heterodyne measurements outperform homodyne measurements for reconstructing Gaussian processes.

Related papers

• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  Conditional measurement is involved to avoid small success probability in ancilla measurement. The objective function for the algorithm can be obtained probabilistically via measurement of the state of a one-qubit subsystem.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Provable Quantum Algorithm Advantage for Gaussian Process Quadrature [8.271361104403802]
  The aim of this paper is to develop novel quantum algorithms for Gaussian process quadrature methods.<n>We propose a quantum low-rank Gaussian process quadrature method based on a Hilbert space approximation of the Gaussian process kernel.<n>We provide a theoretical complexity analysis that shows a quantum computer advantage over classical quadrature methods.
  arXiv  Detail & Related papers  (2025-02-20T11:42:15Z)
• Posterior Contraction Rates for Mat\'ern Gaussian Processes on Riemannian Manifolds [51.68005047958965]
  We show that intrinsic Gaussian processes can achieve better performance in practice. Our work shows that finer-grained analyses are needed to distinguish between different levels of data-efficiency.
  arXiv  Detail & Related papers  (2023-09-19T20:30:58Z)
• A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo [4.134846879110833]
  We introduce a new analog'' quantum representation of processes, in which the value of the process at time t is stored in the amplitude of the quantum state. We show that we can simulate $T$ timesteps of fractional Brownian motion using a quantum circuit with gate complexity $textpolylog(T)$, which coherently prepares the superposition over Brownian paths. We then show this can be combined with quantum mean estimation to create end to end algorithms for estimating certain time averages over processes in time $O(textpolylog(Tepsilon
  arXiv  Detail & Related papers  (2023-03-12T17:54:38Z)
• Huber-energy measure quantization [0.0]
  We describe an algorithm which finds the best approximation of a target probability law by a sum of $Q$ Dirac masses. The procedure is implemented by minimizing the statistical distance between the original measure and its quantized version.
  arXiv  Detail & Related papers  (2022-12-15T21:50:54Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• 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)
• Gaussian Processes and Statistical Decision-making in Non-Euclidean Spaces [96.53463532832939]
  We develop techniques for broadening the applicability of Gaussian processes. We introduce a wide class of efficient approximations built from this viewpoint. We develop a collection of Gaussian process models over non-Euclidean spaces.
  arXiv  Detail & Related papers  (2022-02-22T01:42:57Z)
• Parameterized process characterization with reduced resource requirements [0.5735035463793008]
  This work proposes an alternative approach that requires significantly fewer resources for unitary process characterization without prior knowledge of the process. By measuring the quantum process as rotated through the X and Y axes on the Sphere Bloch, we can acquire enough information to reconstruct the quantum process matrix $chi$ and measure its fidelity. We demonstrate in numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.
  arXiv  Detail & Related papers  (2021-09-22T17:41:32Z)
• Properties and Application of Gaussian Quantum Processes [0.0]
  We show that generic coupler characterized by Gaussian unitary process can be transformed into a high-fidelity transducer. We study the quantum noise theory for optical parameter sensing and its potential in providing great measurement precision enhancement. All the analyses originated from the fundamental quantum commutation relations, and therefore are widely applicable.
  arXiv  Detail & Related papers  (2021-07-03T18:01:34Z)
• Pathwise Conditioning of Gaussian Processes [72.61885354624604]
  Conventional approaches for simulating Gaussian process posteriors view samples as draws from marginal distributions of process values at finite sets of input locations. This distribution-centric characterization leads to generative strategies that scale cubically in the size of the desired random vector. We show how this pathwise interpretation of conditioning gives rise to a general family of approximations that lend themselves to efficiently sampling Gaussian process posteriors.
  arXiv  Detail & Related papers  (2020-11-08T17:09:37Z)
• Mat\'ern Gaussian processes on Riemannian manifolds [81.15349473870816]
  We show how to generalize the widely-used Mat'ern class of Gaussian processes. We also extend the generalization from the Mat'ern to the widely-used squared exponential process.
  arXiv  Detail & Related papers  (2020-06-17T21:05:42Z)

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.