IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2607.19279.html

Gaussian Boson Sampling for Asset Clustering in Statistical Arbitrage Portfolios

Author

Listed:
  • Dayne Marcus Lopena
  • Daniel Buguks
  • Zhenghao Li
  • Ewan Mer
  • Shana H. Winston
  • Shang Yu
  • Mihai Cucuringu
  • Del Rajan
  • Philip Intallura
  • Raj B. Patel

Abstract

Gaussian Boson Sampling (GBS) provides a native photonic quantum heuristic for sampling dense subgraphs from adjacency matrices, offering a scalable physical approach to combinatorial graph search problems. Simultaneously, correlation matrix clustering algorithms, such as Spectral and SPONGE, have established robust benchmarks for identifying co-moving assets from correlation matrices in statistical arbitrage (StatArb) strategies. In this work, we map S&P 500 residual correlation data into GBS-compatible adjacency matrices. We benchmark those classical clustering algorithms against two quantum clustering algorithms, GBS Boost and our novel GBS Roots, to construct dynamic, market-neutral portfolios over a rolling one-year window. Simulations across distinct macroeconomic regimes reveal that quantum clustering generates superior alpha within large stock universes during periods of high volatility, effectively isolating structural market idiosyncrasies. Crucially, this economic advantage persists under simulated low-loss conditions and extends into high-loss regimes via the application of coherent displacement to compensate for photon loss. Our findings underscore the efficacy of GBS-derived graph clustering in constructing robust StatArb portfolios, establishing a quantum foundation for broader quantitative finance applications.

Suggested Citation

  • Dayne Marcus Lopena & Daniel Buguks & Zhenghao Li & Ewan Mer & Shana H. Winston & Shang Yu & Mihai Cucuringu & Del Rajan & Philip Intallura & Raj B. Patel, 2026. "Gaussian Boson Sampling for Asset Clustering in Statistical Arbitrage Portfolios," Papers 2607.19279, arXiv.org.
  • Handle: RePEc:arx:papers:2607.19279
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2607.19279
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2607.19279. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.