Related papers: Learning pure quantum states (almost) without regret

Related papers

Mitigation of correlated readout errors without randomized measurements [0.0]
We present a readout error mitigation protocol that uses only single-qubit Pauli measurements.<n>The proposed approach captures a very broad class of correlated noise models.<n>It is based on a complete and efficient characterization of few-qubit correlated positive operator-valued measures.
arXiv Detail & Related papers (2025-03-31T16:21:45Z)
CondiQuant: Condition Number Based Low-Bit Quantization for Image Super-Resolution [59.91470739501034]
We propose CondiQuant, a condition number based low-bit post-training quantization for image super-resolution.<n>We show that CondiQuant outperforms existing state-of-the-art post-training quantization methods in accuracy without computation overhead.
arXiv Detail & Related papers (2025-02-21T14:04:30Z)
Space-Efficient Quantum Error Reduction without log Factors [50.10645865330582]
We present a new highly simplified construction of a purifier, that can be understood as a weighted walk on a line similar to a random walk interpretation of majority voting. Our purifier has exponentially better space complexity than the previous one, and quadratically better dependence on the soundness-completeness gap of the algorithm being purified.
arXiv Detail & Related papers (2025-02-13T12:04:39Z)
Large Language Monkeys: Scaling Inference Compute with Repeated Sampling [81.34900892130929]
We explore inference compute as another axis for scaling, using the simple technique of repeatedly sampling candidate solutions from a model.<n>Across multiple tasks and models, we observe that coverage scales with the number of samples over four orders of magnitude.<n>In domains like coding and formal proofs, where answers can be automatically verified, these increases in coverage directly translate into improved performance.
arXiv Detail & Related papers (2024-07-31T17:57:25Z)
Efficient learning of quantum states prepared with few fermionic non-Gaussian gates [0.0]
We present an efficient algorithm for learning states on $n$ fermion modes prepared by any number of Gaussian gates. Our work sheds light on the structure of states prepared with few non-Gaussian gates and offers an improved upper bound on their circuit complexity.
arXiv Detail & Related papers (2024-02-28T19:18:27Z)
Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows [1.366942647553326]
We propose a robust protocol for characterizing quantum states on current quantum computing platforms.<n>Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity.<n>This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
arXiv Detail & Related papers (2024-02-27T21:53:32Z)
Assisted metrology and preparation of macroscopic superpositions with split spin-squeezed states [0.0]
We analyse the conditional states in which one part of a split spin-squeezed state is left, upon performing a collective spin measurement on the other part. We show how this measurement-based state preparation approach can allow for the conditional (ie heralded) preparation of spin Schr"odinger's cat states.
arXiv Detail & Related papers (2023-10-19T17:31:37Z)
Importance sampling for stochastic quantum simulations [68.8204255655161]
We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
arXiv Detail & Related papers (2022-12-12T15:06:32Z)
Lower bounds for learning quantum states with single-copy measurements [3.2590610391507444]
We study the problems of quantum tomography and shadow tomography using measurements performed on individual copies of an unknown $d$-dimensional state. In particular, this rigorously establishes the optimality of the folklore Pauli tomography" algorithm in terms of its complexity.
arXiv Detail & Related papers (2022-07-29T02:26:08Z)
Quantum state tomography with tensor train cross approximation [84.59270977313619]
We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
arXiv Detail & Related papers (2022-07-13T17:56:28Z)
Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors [2.3339135709418817]
Mitigating errors in quantum information processing devices is especially important in the absence of fault tolerance. Here, we use classical shadows and randomized measurements to circumvent the need for coherent access to multiple copies at an exponential cost. We optimize measurement resources under realistic experimental constraints and apply our method to an experiment preparing Greenberger-Horne-Zeilinger (GHZ) state with trapped ions.
arXiv Detail & Related papers (2022-03-14T17:14:56Z)
Experimentally determining the incompatibility of two qubit measurements [55.41644538483948]
We describe and realize an experimental procedure for assessing the incompatibility of two qubit measurements. We demonstrate this fact in an optical setup, where the qubit states are encoded into the photons' polarization degrees of freedom.
arXiv Detail & Related papers (2021-12-15T19:01:44Z)
Online estimation and control with optimal pathlength regret [52.28457815067461]
A natural goal when designing online learning algorithms is to bound the regret of the algorithm in terms of the temporal variation of the input sequence. Data-dependent "pathlength" regret bounds have recently been obtained for a wide variety of online learning problems, including OCO and bandits.
arXiv Detail & Related papers (2021-10-24T22:43:15Z)
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning [52.76230802067506]
A novel model-free algorithm is proposed to minimize regret in episodic reinforcement learning. The proposed algorithm employs an em early-settled reference update rule, with the aid of two Q-learning sequences. The design principle of our early-settled variance reduction method might be of independent interest to other RL settings.
arXiv Detail & Related papers (2021-10-09T21:13:48Z)
Direct Measure Matching for Crowd Counting [59.66286603624411]
We propose a new measure-based counting approach to regress the predicted density maps to the scattered point-annotated ground truth directly. In this paper, we derive a semi-balanced form of Sinkhorn divergence, based on which a Sinkhorn counting loss is designed for measure matching.
arXiv Detail & Related papers (2021-07-04T06:37:33Z)
Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing [87.17253904965372]
We consider sequential hypothesis testing between two quantum states using adaptive and non-adaptive strategies. We show that these errors decrease exponentially with decay rates given by the measured relative entropies between the two states.
arXiv Detail & Related papers (2021-04-30T00:52:48Z)
Quantum data hiding with continuous variable systems [8.37609145576126]
We investigate data hiding in the context of continuous variable quantum systems. We look at the case where $mathcalM=mathrmLOCC$, the set of measurements implementable with local operations and classical communication. We perform a rigorous quantitative analysis of the error introduced by the non-ideal Braunstein-Kimble quantum teleportation protocol.
arXiv Detail & Related papers (2021-02-01T19:00:14Z)
Fourier-style Quantum State Tomography and Purity Measurement of a Multi-qubit System from Bloch Rotations [0.0]
We consider the use of random-axis measurements for quantum state tomography and state purity estimation. We propose a simple protocol which relies on single-pulse X/Y rotations only.
arXiv Detail & Related papers (2021-01-14T20:38:39Z)
More Practical and Adaptive Algorithms for Online Quantum State Learning [11.836183463815653]
In this paper, we develop algorithms to advance the online learning of quantum states. First, we show that Regularized Follow-the-Leader (RFTL) method with Tallis-2 entropy can achieve an $O(sqrtMT)$ total loss with perfect hindsight. Second, we propose a parameter-free algorithm based on a classical adjusting learning rate schedule.
arXiv Detail & Related papers (2020-06-01T15:17:55Z)
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model [50.38446482252857]
This paper is concerned with the sample efficiency of reinforcement learning, assuming access to a generative model (or simulator) We first consider $gamma$-discounted infinite-horizon Markov decision processes (MDPs) with state space $mathcalS$ and action space $mathcalA$. We prove that a plain model-based planning algorithm suffices to achieve minimax-optimal sample complexity given any target accuracy level.
arXiv Detail & Related papers (2020-05-26T17:53:18Z)
Frequentist Regret Bounds for Randomized Least-Squares Value Iteration [94.47472987987805]
We consider the exploration-exploitation dilemma in finite-horizon reinforcement learning (RL) In this paper, we introduce an optimistically-perturbed variant of the popular randomized least-squares value (RLSVI) Under the assumption that the Markov decision process has low-rank transition dynamics, we prove that the frequentist regret of RLSVI is upper-bounded by $widetilde O(d2 H2 sqrtT)$ where $ d $ are the feature dimension, $ H $ is the horizon, and $ T $ is the total number of
arXiv Detail & Related papers (2019-11-01T19:48:57Z)
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime [52.38455827779212]
We propose a novel technique for analyzing adaptive sampling called the em Simulator. We prove the first instance-based lower bounds the top-k problem which incorporate the appropriate log-factors. Our new analysis inspires a simple and near-optimal for the best-arm and top-k identification, the first em practical of its kind for the latter problem.
arXiv Detail & Related papers (2017-02-16T23:42:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.