Designing optimal linear detectors -- a bottom-up approach
- URL: http://arxiv.org/abs/2110.07942v5
- Date: Fri, 6 Jan 2023 09:46:29 GMT
- Title: Designing optimal linear detectors -- a bottom-up approach
- Authors: Joe Bentley, Hendra Nurdin, Yanbei Chen, Xiang Li, Haixing Miao
- Abstract summary: This paper develops a systematic approach to realising linear detectors with an optimised sensitivity.
General constraints are derived on a specific class of input-output transfer functions of a linear detector.
A physical realization of transfer functions in that class is found using the quantum network synthesis technique.
- Score: 11.04648316642923
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper develops a systematic approach to realising linear detectors with
an optimised sensitivity, allowing for the detection of extremely weak signals.
First, general constraints are derived on a specific class of input-output
transfer functions of a linear detector. Then a physical realization of
transfer functions in that class is found using the quantum network synthesis
technique, which allows for the inference of the physical setup directly from
the input-output transfer function. By exploring a minimal realization which
has the minimum number of internal modes, it is shown that the optimal such
detectors are internal squeezing schemes. Then, investigating non-minimal
realizations, which is motivated by the parity-time symmetric systems, a
quantum non-demolition measurement is systematically recovered.
Related papers
- Bisimulation Learning [55.859538562698496]
We compute finite bisimulations of state transition systems with large, possibly infinite state space.
Our technique yields faster verification results than alternative state-of-the-art tools in practice.
arXiv Detail & Related papers (2024-05-24T17:11:27Z) - Compensating for non-linear distortions in controlled quantum systems [0.0]
Distortion of the input fields in an experimental platform alters the model accuracy and disturbs the predicted dynamics.
We present an effective method for estimating these distortions which is suitable for non-linear transfer functions of arbitrary lengths and magnitudes.
We have successfully tested our approach for a numerical example of a single Rydberg atom system.
arXiv Detail & Related papers (2022-10-14T14:02:39Z) - Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces.
We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
arXiv Detail & Related papers (2022-04-20T21:15:38Z) - Gradient-Based Learning of Discrete Structured Measurement Operators for
Signal Recovery [16.740247586153085]
We show how to leverage gradient-based learning to solve discrete optimization problems.
Our approach is formalized by GLODISMO (Gradient-based Learning of DIscrete Structured Measurement Operators)
We empirically demonstrate the performance and flexibility of GLODISMO in several signal recovery applications.
arXiv Detail & Related papers (2022-02-07T18:27:08Z) - Deep Learning Approximation of Diffeomorphisms via Linear-Control
Systems [91.3755431537592]
We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls.
We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
arXiv Detail & Related papers (2021-10-24T08:57:46Z) - Quantum-tailored machine-learning characterization of a superconducting
qubit [50.591267188664666]
We develop an approach to characterize the dynamics of a quantum device and learn device parameters.
This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data.
This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
arXiv Detail & Related papers (2021-06-24T15:58:57Z) - Deep learning with transfer functions: new applications in system
identification [0.0]
This paper presents a linear dynamical operator endowed with a well-defined and efficient back-propagation behavior for automatic derivatives computation.
The operator enables end-to-end training of structured networks containing linear transfer functions and other differentiable units.
arXiv Detail & Related papers (2021-04-20T08:58:55Z) - Linear Ascending Metrological Algorithm [0.0]
Recent advances in quantum devices and novel quantum algorithms utilizing interference effects are opening new routes for overcoming the detrimental noise tyranny.
We devise the Linear Ascending Metrological Algorithm (LAMA) which offers a remarkable increase in precision in the demanding situation where a decohering quantum system is used to measure a continuously distributed variable.
Our findings demonstrate a quantum-metrological procedure capable of mitigating detrimental dephasing and relaxation effects.
arXiv Detail & Related papers (2021-03-24T12:40:43Z) - Activation Relaxation: A Local Dynamical Approximation to
Backpropagation in the Brain [62.997667081978825]
Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system.
Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
arXiv Detail & Related papers (2020-09-11T11:56:34Z) - Fast inversion, preconditioned quantum linear system solvers, and fast
evaluation of matrix functions [4.327821619134312]
We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems.
We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems.
arXiv Detail & Related papers (2020-08-30T23:24:58Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z)
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.