Results 61 to 70 of about 7,819 (154)

Financial Time Series Uncertainty: A Review of Probabilistic AI Applications

Journal of Economic Surveys, Volume 40, Issue 2, Page 915-953, April 2026.
ABSTRACT Probabilistic machine learning models offer a distinct advantage over traditional deterministic approaches by quantifying both epistemic uncertainty (stemming from limited data or model knowledge) and aleatoric uncertainty (due to inherent randomness in the data), along with full distributional forecasts.
Sivert Eggen, Tord Johan Espe, Kristoffer Grude, Morten Risstad, Rickard Sandberg   +4 more
wiley   +1 more source

Appearance and Stability of Anomalously Fluctuating States in Shor's Factoring Algorithm

, 2004
We analyze quantum computers which perform Shor's factoring algorithm, paying attention to asymptotic properties as the number L of qubits is increased.
A. Ekert, A. Ekert, A. Miyake, A. Shimizu, A. Shimizu, A. Shimizu, A. Shimizu, Akihisa Ukena, Akira Shimizu, C. Miquel, D. Deutsch, D. Gottesman, D. Kielpinski, D.A. Lidar, G.M. Palma, J. Preskill, M. Covington, P. Horsh, P. Zanardi, P.W. Anderson, P.W. Shor, R.L. Kautz, T. Koma, W.G. Unruh, Y. Nakamura   +24 more
core   +1 more source

A Curie Point Depth Model of the Conterminous United States Derived From a Prior‐Constrained Equivalent Source Inversion

Geophysical Research Letters, Volume 53, Issue 5, 16 March 2026.
Abstract The Curie Point Depth (CPD) is a key thermal boundary in the deep lithosphere and is widely used to constrain its thermal structure. However, uncertainties in magnetization and the non‐uniqueness of inversion lead to considerable inter‐study differences.
Chuanjie Chen, Zhengtao Wang, Yu Gao, Ziyi Zhu   +3 more
wiley   +1 more source

Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms

Forum of Mathematics, Pi
In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj   +1 more source

Quantum Hidden Subgroup Algorithms: The Devil Is in the Details

, 2004
We conjecture that one of the main obstacles to creating new non-abelian quantum hidden subgroup algorithms is the correct choice of a transversal.Comment: 5 pages, to appear in April 2004 Proceedings of SPIE on Quantum Information and ...
Kauffman, Louis H., Lomonaco, Jr., Samuel J.   +1 more
core   +1 more source

Exploring Imprecise Probabilities in Quantum Algorithms with Possibility Theory

Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 1, March 2026.
ABSTRACT Quantum computing utilizes the underlying principles of quantum mechanics to perform computations with unmatched performance capabilities. Rather than using classical bits, it operates on qubits, which can exist in superposition and entangled states. This enables the solution of problems that are considered intractable for classical computers.
Jan Schneider, Tom Könecke, Michael Hanss   +2 more
wiley   +1 more source

Scalability of Shor's algorithm with a limited set of rotation gates

, 2004
Typical circuit implementations of Shor's algorithm involve controlled rotation gates of magnitude $\pi/2^{2L}$ where $L$ is the binary length of the integer N to be factored.
A. M. Steane, A. R. Calderbank, M. A. Nielson, P. W. Shor, S. Beauregard   +4 more
core   +1 more source

Photonic Unitary Circuits for Quantum Information Processing

Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.
Unitary transformations are the cornerstone of quantum computing, enabling reversible manipulation of quantum states. This review evaluates photonic waveguide architectures as an evolving solution for quantum computing, exploiting the unique properties of photons. It investigates current theoretical frameworks, material platforms, and design strategies.
Kevin Zelaya, Armando Perez‐Leija, Abdou Shetewy, Jonathan Friedman, Menglong He, Kambiz Jamshidi, Mohammad‐Ali Miri   +6 more
wiley   +1 more source

Experimental realisation of Shor's quantum factoring algorithm using qubit recycling

, 2012
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the international effort ...
A Aspuru-Guzik, A Politi, Anthony Laing, BP Lanyon, BP Lanyon, C-Y Lu, D Beckman, D Deutsch, E Knill, Enrique Martín-López, HF Hofmann, JD Whitfield, Jeremy L. O'Brien, JL O'Brien, JL O'Brien, L Veis, LMK Vandersypen, M Mosca, MA Nielsen, PG Kwiat, R Prevedel, RB Griffiths, Roberto Alvarez, RP Feynman, S Parker, TC Ralph, TD Ladd, Thomas Lawson, X-Q Zhou, Xiao-Qi Zhou, Z Li   +30 more
core   +1 more source

Declines in Conifer Forest Recovery and Forest Loss From Four Decades of Wildfire in California

Journal of Geophysical Research: Biogeosciences, Volume 131, Issue 3, March 2026.
Abstract California's forests are increasingly being exposed to intense wildfires. Past research has tracked wildfires' impact on these natural lands, yet there remains a critical gap in tracking post‐fire vegetation recovery and its trends, particularly for the extent of different forest types.
Ved N. Bhoot, Jinhyuk E. Kim, James T. Randerson, Michael L. Goulden   +3 more
wiley   +1 more source