This work proposes a qubit-efficient Boolean quantum oracle for threshold-based risk screening motivated by VaR analysis that has the ability to directly flag loss scenarios that violate a predefined threshold condition without utilizing high depth quantum adders or quantum subtractors.
Abstract
Value-at-risk (VaR) is a broadly used measure for evaluating financial tail risk, but its estimation depends on assessing threshold exceeding probabilities over complex loss distributions. Probability estimation tasks using quantum algorithms works based on amplitude estimation that has a potential to offer quadratic speedup; however, their implementation on noisy intermediate-scale quantum devices is obstructed by the qubit and circuit depth requirements of arithmetic-heavy comparator oracles. This work proposes a qubit-efficient Boolean quantum oracle for threshold-based risk screening motivated by VaR analysis that has the ability to directly flag loss scenarios that violate a predefined threshold condition without utilizing high depth quantum adders or quantum subtractors. The proposed oracle employs a risk ancilla together with a reusable work qubit and utilizes a shallow circuit depth, making it a feasible candidate for near-term quantum hardware. In this work we analyze the resource scaling of the proposed oracle and benchmark it against arithmetic-based approaches under noisy simulations. This work further shows how the proposed oracle can be integrated within a hybrid quantum–classical variational optimization framework to restrain high-risk configurations.
This structured critical review describes quantum algorithm search scope, selection criteria and limitations, and distinguishes reported findings from author assessments, and identifies input/output costs, structured algorithms, reproducible benchmarking and explicit financial evaluation as priorities.
Luigi Laura, Marco Parrillo, Alessio Pascucci et al.· Information· 0 citations
This work introduces an efficient simulation framework that integrates the sum-over-Clifford method with quasi-probability-based stabilizer simulation to directly estimate expectation values and explicitly proves the sample-complexity reduction for random quantum circuits and T-doped Clifford circuits and also empirica...
Yunseo Hwang, Giwon Song, Kyoung Keun Park et al.· 0 citations
FlowMeas is introduced, which uses a generative flow network to directly sample finite ensembles of shallow Clifford measurement circuits subject to a prescribed shot budget and hardware constraints, and establishes generative learning as a flexible and unified framework for quantum measurement design under practical r...
Jun Dai, O. Nahman-Lévesque, Guillaume Rabusseau et al.· 0 citations
Chameleon is presented, a fast, high-performance, and code-agnostic Clifford deformation compiler that utilizes an approximation to tackle a deformation problem based on an analytical bound on the LER, and finds an optimized deformation that empirically reduces the LER with substantially lower computational overhead.
Won Joon Yun, Andrew Nemec, Jonathan M. Baker· 0 citations
KANs offer a promising, efficient, and interpretable machine-learning approach for finite-measurement steering detection of arbitrary two-qubit states, and further feature compression can still retain competitive detection performance.
This review examines ansatz-design and complementary mitigation strategies for few-qubit QNNs under finite-shot noisy intermediate-scale quantum (NISQ) constraints and proposes a complete eight-configuration factorial framework for evaluating interactions among restricted entanglement, local cost functions, and active...
Brandon Shen, K. Ling· Journal of high school scien...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.