Parametrized Variational Quantum Tomography

• URL: http://arxiv.org/abs/2604.27135v1
• Date: Wed, 29 Apr 2026 19:35:49 GMT
• Title: Parametrized Variational Quantum Tomography
• Abstract summary: We introduce a parametrized cost function that interpolates between the 1-norm and the infinity norm, thereby unifying VQT and VQT$_infty$ within a single framework.<n>We show that this interplay yields reconstructed states with higher fidelity to the MaxEnt solution than those obtained via VQT$_infty$ while preserving computational tractability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum state tomography provides a fundamental framework for reconstructing quantum states. When the measurement data are not informationally complete, the observed statistics admit multiple compatible density matrices, making the reconstruction problem inherently underdetermined and calling for the selection of a meaningful estimator. Two well-established approaches to address this ambiguity are Maximum Entropy (MaxEnt) and Variational Quantum Tomography (VQT). A variant of VQT, named VQT$_\infty$, has been introduced to reproduce MaxEnt-like solutions. In this work, we generalize this approach by introducing a parametrized cost function that interpolates between the 1-norm and the infinity norm, thereby unifying VQT and VQT$_\infty$ within a single framework. By tuning the associated hyperparameters, the proposed method enables controlled exploration of the set of compatible density matrices. We show that this interplay yields reconstructed states with higher fidelity to the MaxEnt solution than those obtained via VQT$_\infty$ while preserving computational tractability.

Related papers

• Linearised quantum signal processing [0.0]
  We show that UHET can be interpreted as a (randomised) linearisation of Generalised QSP (GQSP)<n>We introduce a linearised variant of (Hamiltonian-based) QSVT, that enables the efficient transformation of the singular values of any arbitrary matrix $A$ encoded in a block of a Hamiltonian.<n>Our algorithm requires the sole condition that $f$ vanishes at the origin.
  arXiv  Detail & Related papers  (2026-08-14T15:29:37Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Solving the 3D Heat Equation with VQA via Remeshing-Based Warm Starts [0.0]
  Variational Quantum Algorithms (VQAs) have emerged as a leading candidate for near-term applications.<n>In this work, we investigate the use of VQAs to solve PDEs arising in stationary heat transfer.<n>This work provides a practical methodology for applying VQAs to PDEs, offering insight into the capabilities and limitations of current quantum hardware.
  arXiv  Detail & Related papers  (2025-10-17T13:34:42Z)
• A Random Matrix Theory of Pauli Tomography [0.0]
  A detailed characterization of the error $Deltahatrho = hatrho-hatrhoprime$ in a QST reconstruction is of clear importance to quantum theory and experiment.<n>We develop a fully random matrix theory (RMT) treatment of state tomography in informationally-complete bases.
  arXiv  Detail & Related papers  (2025-06-13T17:58:14Z)
• An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
  We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem. We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
  arXiv  Detail & Related papers  (2024-06-11T04:40:05Z)
• Approximately Equivariant Quantum Neural Network for $p4m$ Group Symmetries in Images [30.01160824817612]
  This work proposes equivariant Quantum Convolutional Neural Networks (EquivQCNNs) for image classification under planar $p4m$ symmetry. We present the results tested in different use cases, such as phase detection of the 2D Ising model and classification of the extended MNIST dataset.
  arXiv  Detail & Related papers  (2023-10-03T18:01:02Z)
• Quantum Covariance Scalar Products and Efficient Estimation of Max-Ent Projections [0.0]
  The maximum-entropy principle (Max-Ent) is a valuable tool in statistical mechanics and quantum information theory. It provides a method for inferring the state of a system by utilizing a reduced set of parameters associated with measurable quantities. The computational cost of employing Max-Ent projections in simulations of quantum many-body systems is a significant drawback.
  arXiv  Detail & Related papers  (2023-07-17T17:46:05Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• High Fidelity Quantum State Transfer by Pontryagin Maximum Principle [68.8204255655161]
  We address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann equation. By introducing fidelity as the performance index, we aim at maximizing the similarity of the final state density operator with the one of the desired target state.
  arXiv  Detail & Related papers  (2022-03-07T13:27:26Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.