Variational Quantum Sensing for Structured Linear Function Estimation
- URL: http://arxiv.org/abs/2507.22043v1
- Date: Tue, 29 Jul 2025 17:48:14 GMT
- Title: Variational Quantum Sensing for Structured Linear Function Estimation
- Authors: Priyam Srivastava, Vivek Kumar, Gurudev Dutt, Kaushik P. Seshadreesan,
- Abstract summary: We study the variational optimization of entangled probe states for quantum sensing tasks.<n>Specifically, we consider scenarios where each qubit in a spin-1/2 array accumulates a phase phi_i = alpha_i * theta.<n>We benchmark the optimized circuits for two relevant cases: (i) uniform encoding, where all qubits contribute equally to the phase function, and (ii) a custom encoding where a central qubit dominates the weight vector.
- Score: 0.7783491525078104
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study the variational optimization of entangled probe states for quantum sensing tasks involving the estimation of a structured linear function of local phase parameters. Specifically, we consider scenarios where each qubit in a spin-1/2 array accumulates a phase phi_i = alpha_i * theta, with a known weight vector alpha, reducing the task to single-parameter estimation of theta. Using parameterized quantum circuits composed of dipolar-interacting gates and global rotations, we optimize probe states with respect to the Classical Fisher Information (CFI) using a gradient-free evolutionary strategy. We benchmark the optimized circuits for two relevant cases: (i) uniform encoding, where all qubits contribute equally to the phase function, and (ii) a custom encoding where a central qubit dominates the weight vector. In both cases, the optimized probe states approach the respective entanglement-enhanced (EE) limits dictated by the encoding structure. Our results demonstrate the power of variational approaches for tailoring metrologically useful entanglement to specific estimation tasks in quantum sensor networks.
Related papers
- Universal Configuration for Optimizing Complexity in Variational Distributed Quantum Circuits [0.0]
We show the existence of a universal optimal configuration for distributing single and two qubit gates across arbitrary intercore communication topologies.<n>We validate our predictions through numerical comparisons with the well established majorization criterion proposed in Ref 2.
arXiv Detail & Related papers (2025-08-06T14:03:52Z) - Adaptive Bayesian Single-Shot Quantum Sensing [35.355128149649666]
In variational quantum sensing, a probe quantum system is generated via a parameterized quantum circuit.<n>This paper introduces an adaptive protocol that uses Bayesian inference to optimize the active information gain.
arXiv Detail & Related papers (2025-07-22T11:35:27Z) - Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
arXiv Detail & Related papers (2024-11-25T20:33:47Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Finding the optimal probe state for multiparameter quantum metrology
using conic programming [61.98670278625053]
We present a conic programming framework that allows us to determine the optimal probe state for the corresponding precision bounds.
We also apply our theory to analyze the canonical field sensing problem using entangled quantum probe states.
arXiv Detail & Related papers (2024-01-11T12:47:29Z) - Parsimonious Optimisation of Parameters in Variational Quantum Circuits [1.303764728768944]
We propose a novel Quantum-Gradient Sampling that requires the execution of at most two circuits per iteration to update the optimisable parameters.
Our proposed method achieves similar convergence rates to classical gradient descent, and empirically outperforms gradient coordinate descent, and SPSA.
arXiv Detail & Related papers (2023-06-20T18:50:18Z) - Optimal Generators for Quantum Sensing [0.0]
We show that the maximal sensitivity using a given quantum state is determined by the largest eigenvalue of the quantum Fisher information matrix (QFIM)
Since we optimize the process of parameter encoding rather than focusing on state preparation protocols, our scheme is relevant for any quantum sensor.
arXiv Detail & Related papers (2023-05-24T20:42:38Z) - Efficient variational quantum circuit structure for correlated
topological phases [0.0]
We propose an efficient circuit structure of variational quantum circuit textitAnsatz used for the variational quantum eigensolver (VQE) algorithm.
We investigate the symmetry-protected topological Haldane phase in a textitnon-exactly solvable alternating spin-$1/2$ Heisenberg chain by VQE calculations.
arXiv Detail & Related papers (2023-03-30T06:49:28Z) - Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
arXiv Detail & Related papers (2022-09-28T20:24:53Z) - 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) - Information Entropy Initialized Concrete Autoencoder for Optimal Sensor
Placement and Reconstruction of Geophysical Fields [58.720142291102135]
We propose a new approach to the optimal placement of sensors for reconstructing geophysical fields from sparse measurements.
We demonstrate our method on the two examples: (a) temperature and (b) salinity fields around the Barents Sea and the Svalbard group of islands.
We find out that the obtained optimal sensor locations have clear physical interpretation and correspond to the boundaries between sea currents.
arXiv Detail & Related papers (2022-06-28T12:43:38Z) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - Large gradients via correlation in random parameterized quantum circuits [0.0]
The presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods.
We prove that reducing the dimensionality of the parameter space can allow one to circumvent the vanishing gradient phenomenon.
arXiv Detail & Related papers (2020-05-25T16:15:53Z)
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.