Open Source
Learning Integer Winding Evolution Times in Quantum Phase Estimation
arXiv math.IT0 views
arXiv:2611.25124v1 Announce Type: cross Abstract: Learning a Hamiltonian evolution time in Quantum Phase Estimation that produces phase distributions with low Shannon entropy circumvents the fundamental limit of digitization error of phase, independent of the number of phase qubits of accuracy. By introducing an optimization loop to minimize the Shannon entropy of measured eigenvalues produced by a QPE quantum circuit, minimum eigenvalue computation accuracy is greatly improved, which we show numerically on quantum magnet models. This technique works because standard QPE has a natural correspondence between entropy of the phase distribution and the analog accuracy of the minimum eigenvalue phase. This introduces for the first time a type of parameter learning to QPE, which makes near term practicality of QPE for fundamental sciences more feasible by using shorter depth QPE circuits.
Source:https://arxiv.org/abs/2611.25124PreviousEntanglement Geometry Beyond Polygons: Graph-Theoretic Entanglement InequalitiesNextUnique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
Related posts
How to Test a Resistor, Diode, LED and Capacitor with a Multimeter (Before You Blame Your Code)
0dev.to Beginners
Omni-modal decomposition autoencoders learn full-stack wearable disentangled representations
0arXiv eess.SP
Spectral Vision Transformer for Efficient Tokenization with Limited Data
0arXiv eess.SP
Gaussian Quasi-Likelihood Estimation for Nonsynchronously Observed L\'evy processes
0arXiv stat.TH
Triple Overlap in Pipelined Krylov Methods on Multi-GPU Systems
0arXiv cs.DC
Rhythm-TTS: High-Fidelity Shortcut Latent Modeling and Probabilistic Rhythm Generation for Zero-Shot Text-to-Speech
0arXiv cs.SD