Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

112225337449 · Jun 202019922001200920172026
48 results for quantum process tomography

Study online learning of quantum processes, showing feasibility for certain types.

problem Learning quantum processes adaptively, especially for bounded gate complexity and Pauli channels.
method Online learning, mistake-bounded model, multiplicative weights update algorithm, Bell sampling.
result Online learning feasible for quantum channels of bounded gate complexity and Pauli channels.

Quantum states can be learned efficiently using gentle measurements.

problem Efficiently learning quantum states with minimal measurements.
method Introducing α-LGM measurements and proving strong quantum DPI.
result The number of states needed for accurate learning is of order 1/(ε^2 α^2).

New quantum state reconstruction method accelerates convergence.

problem Quantum state reconstruction for larger systems.
method Momentum-Inspired Factored Gradient Descent (MiFGD) combining compressed sensing, non-convex optimization, and acceleration.
result Converges to true density matrix at an accelerated linear rate, provably close to the true matrix.

Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. However, usual QPT procedure…

2019-09-18abs ↗pdf ↗

A new method speeds up quantum state estimation.

problem Exponential growth in sample size and dimension for quantum state tomography.
method Stochastic mirror descent with Burg entropy.
result Optimization error vanishes at a O((1/t)dlogt)O (\sqrt{ ( 1 / t ) d \log t }) rate.

The problem of using observed correlations to infer causal relations is relevant to a wide variety of scientific disciplines. Yet given correlations between just two classical variables, it is impossible to determine whether they arose from a causal influence of one on the other or a common cause influencing both, unle…

2014-06-19abs ↗pdf ↗

Study on learning quantum dynamics without direct interaction.

problem Learning quantum dynamics incoherently without direct interaction.
method Analyze sample complexity and prove bounds for incoherent learning.
result Prove that arbitrary measurements allow efficient learning of unitary processes incoherently.

New quantum states capture more information, enabling advanced processing tasks.

problem Quantum information processing challenges with limited statistical information.
method Introducing Random-Coefficient Pure States (RCPS) and exploiting their higher-order statistics.
result RCPS provide richer information than density operators, enabling new quantum tasks.

This paper compares classical shadows and direct quantum measurement for efficient information extraction.

problem Efficiently extracting classical information from quantum states with limited classical post-processing.
method Quantitative resource analysis comparing classical shadows and direct quantum measurement.
result An efficiency frontier between classical shadows and direct quantum measurement is identified.

Method learns topological states from randomized measurements.

problem Detecting topologically ordered two-dimensional states on quantum processors.
method Variational tensor network tomography with randomized measurements.
result Demonstrated ability to learn ground states of surface code and quantum spin liquid states.

New method uses single quantum state for machine learning tasks, improving accuracy.

problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.

Adversarial learning is one of the most successful approaches to modelling high-dimensional probability distributions from data. The quantum computing community has recently begun to generalize this idea and to look for potential applications. In this work, we derive an adversarial algorithm for the problem of approxim…

2018-06-01abs ↗pdf ↗

Global stability bounds for matrix frames in phase retrieval problems.

problem Phase retrieval for matrix frames in various applications.
method Computable global stability bounds for the quasi-linear analysis map β, using Whitney stratification of positive semidefinite matrices of low rank.
result Novel conditions for a frame to be generalized phase retrievable.

Unified approach for learning quantum operations from measurements.

problem Accurate reconstruction of unknown quantum operations from noisy measurements.
method Matrix sensing techniques, randomized measurement design, blockwise measurement design, alternating least squares (ALS).
result The proposed method provides theoretical guarantees for the identifiability and recovery of low-rank superoperators in the presence of noise.

The density matrices are positively semi-definite Hermitian matrices of unit trace that describe the state of a quantum system. The goal of the paper is to develop minimax lower bounds on error rates of estimation of low rank density matrices in trace regression models used in quantum state tomography (in particular, i…

2015-07-17abs ↗pdf ↗

This work tackles uncertainty quantification in tomography reconstruction.

problem Ill-posed nature of tomographic reconstruction leading to no unique solution.
method Gaussian process modeling to incorporate prior knowledge and experimental noises.
result Efficient uncertainty quantification in tomographic reconstruction.

Quantum machine learning has received significant attention in recent years, and promising progress has been made in the development of quantum algorithms to speed up traditional machine learning tasks. In this work, however, we focus on investigating the information-theoretic upper bounds of sample complexity - how ma…

2015-01-03abs ↗pdf ↗

We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rd poly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed sensing: recovering a sparse vector from a few of its Fourier coeffic…

2011-03-14abs ↗pdf ↗

Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the 1\ell_1-norm. However, several important learning applications cannot benefit from this approach as they feature these convex norms as constraints in addition to the non-convex rank a…

2012-06-07abs ↗pdf ↗

Studying general quantum many-body systems is one of the major challenges in modern physics because it requires an amount of computational resources that scales exponentially with the size of the system.Simulating the evolution of a state, or even storing its description, rapidly becomes intractable for exact classical…

2017-10-02abs ↗pdf ↗

Consider a compact Riemannian manifold of dimension 3\geq 3 with strictly convex boundary, such that the manifold admits a strictly convex function. We show that the attenuated ray transform in the presence of an arbitrary connection and Higgs field is injective modulo the natural obstruction for functions and one-for…

2016-05-25abs ↗pdf ↗

Paper generalizes VB-FTRL for online learning of quantum states with logarithmic loss.

problem Online learning of quantum states with logarithmic loss.
method Generalizes VB-FTRL algorithm for LL-OLQS with polynomial-time implementation.
result Achieves a regret rate of O(d2log(d+T))O (d^2 \log (d + T)) for LL-OLQS.

Study travel time tomography for transversely isotropic media using modified pseudodifferential calculus.

problem Travel time tomography problem for transversely isotropic media.
method Modified scattering pseudodifferential calculus to solve the tomography problem.
result Construction and use of modified pseudodifferential calculus to solve the tomography problem.

Paper addresses travel time tomography stability and statistical inversion.

problem Determining conformal factors of metrics from geodesic lengths.
method Established forward and inverse stability estimates; applied to Bayesian statistical inversion.
result Consistency of statistical inversion technique for travel time tomography.

Deep learning is having a profound impact in many fields, especially those that involve some form of image processing. Deep neural networks excel in turning an input image into a set of high-level features. On the other hand, tomography deals with the inverse problem of recreating an image from a number of projections.…

2017-01-02abs ↗pdf ↗

Study uses machine learning to solve photoacoustic tomography's inverse problem.

problem Solving the full inverse problem in photoacoustic tomography.
method Developed an approach using variational autoencoders for Bayesian estimation of the posterior distribution.
result Evaluated the approach with numerical simulations and compared it to a Bayesian solution.

These are lecture notes for the course "Analysis and X-ray tomography". The course is a broad overview of various tools in analysis that can be used to study X-ray tomography. The focus is on tools and ideas, not so much on technical details and minimal assumptions. Only very basic functional analysis is assumed as bac…

2017-11-15abs ↗pdf ↗

Quantum Signal Processing reduces derivative pricing quantum resource requirements.

problem Efficiently pricing financial derivatives on quantum computers.
method Quantum Signal Processing (QSP) to encode payoffs directly into quantum amplitudes.
result Significantly reduces quantum resources (T-gates and qubits) for practical derivative contracts.

Deep kernel learning refers to a Gaussian process that incorporates neural networks to improve the modelling of complex functions. We present a method that makes this approach feasible for problems where the data consists of line integral measurements of the target function. The performance is illustrated on computed t…

2019-09-04abs ↗pdf ↗

Deep network improves electrical tomography across multiple frequencies.

problem Nonlinear multi-frequency electrical impedance tomography (mfEIT) for tissue conductivity estimation.
method Integrates graph neural networks (GNNs) into the iterative Proximal Regularized Gauss Newton (PRGN) framework to reconstruct tissue concentrations accurately.
result Accurate reconstruction of overlapping tissue fraction concentrations across multiple frequencies.

This paper proposes a brain-inspired approach to quantum machine learning with the goal of circumventing many of the complications of other approaches. The fact that quantum processes are unitary presents both opportunities and challenges. A principal opportunity is that a large number of computations can be carried ou…

2018-10-13abs ↗pdf ↗

This work combines deep learning and sparse coding for CT image reconstruction.

problem Improving image quality in low-dose CT scans.
method Sparse signal representation using learned dictionaries, inspired by variational autoencoders and deep learning techniques.
result Regularization with learned dictionaries achieves competitive performance in CT reconstruction.

Quantum-assisted Gaussian process speeds up data regression.

problem High computational complexity of Gaussian process regression for large datasets.
method Quantum-assisted sparse Gaussian process regression using random Fourier features.
result Achieves polynomial-order computational speedup compared to classical methods.

Boosted Frank-Wolfe accelerates optimization for nonconvex problems.

problem Optimizing nonconvex and quasar-convex objectives efficiently.
method Developed a novel step size strategy for stochastic Frank-Wolfe, extending it to various gradient estimators.
result Boosted Frank-Wolfe achieves faster convergence rates than non-boosted Frank-Wolfe.

Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.

problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.