quant-ph Quantum Physics

Quantum Physics papers on arXiv

Track quantum information, quantum computation, and foundational quantum physics in quant-ph. A protocol, physical platform, or resource is a useful anchor for a feed in this broad category.

5,320 papers indexed

Follow the whole category with the official quant-ph RSS feed, or use a personal filter to select keywords and authors. See the arXiv RSS feed guide for setup and the category guide for primary and cross-listed subjects.

Filter ideas for Quantum Physics

How filters work

Use OR for related terminology such as error correction and fault tolerance when either is relevant. Add an experimental platform only when you want to exclude otherwise useful platform-independent results.

  • Entanglement

    Add a system or task such as networks, certification, or many-body dynamics.

    Category quant-ph + abstract contains “entanglement”
    Try filter
  • Quantum error correction

    Follow code and correction studies; add a code family or hardware term for a narrower feed.

    Category quant-ph + abstract contains “error correction”
    Try filter

Examples are starting points. Preview them before saving; keyword matches do not assess a paper’s quality. Recent papers below use the primary category; saved category filters also match cross-listed categories.

Recent Quantum Physics papers

5 recent papers
  • Robert Schade, Shailendra K. Rathor, Tim J. Bartley, Benjamin Brecht, Christian Plessl, Jan Sperling, Michael Stefszky, Christine Silberhorn, Jörg Schumacher

    Abstract

    Boson sampling machines have become a fruitful tool for establishing new concepts, which connect fundamental physics with computer science applications. Here, we exploit the intrinsically high-dimensional correlations generated by the measurement outcomes of a multiphoton boson sampling machine and demonstrate how a reconfigurable architecture can be programmed to autonomously model the time evolution of nonlinear dynamical systems that describe complex fluid flows. By extending on the original scattershot boson sampling (SBS) scheme to include higher photon number components -- a scheme which we label bright scattershot boson sampling (BSBS) --- this scheme overcomes scaling issues inherent to SBS-based schemes by utilizing all randomly generated input photon number distributions. We illustrate the capability of this scheme for two complex fluid-flow models: an eight-dimensional Lorenz-type model of two-dimensional thermally driven convection and a 16-dimensional model of global atmospheric circulation. Using a digital twin of the BSBS architecture based on multiphoton statistics, we show that the photonic approach accurately reproduces the temporal dynamics of both systems while being resilient to photon losses of up to 50 per cent. We also verified that the BSBS case outperforms a comparable run with coherent light. Moreover, its prediction horizon exceeds that of a classical reservoir-computing model with the same query complexity. These results highlight the potential of near-term photonic quantum computing for addressing relevant real-world tasks on noisy intermediate-scale devices.

  • Ellen Martins Fernandes, Fabricio Macedo de Souza

    Abstract

    We study entanglement generation between two spin qubits mediated by a single, thermally mixed, high-spin (S=5/2S=5/2) magnetic impurity, using the Lindblad master equation to compare coherent and dissipative control of the mediator. We show that no coherent drive, however strong or resonant, can purify the mediator beyond its thermal value --- a direct consequence of unitary evolution exactly preserving state purity --- while a dissipative channel purifies it up to the limit set by the optical pumping cycle itself, Tr[ρM2]≈0.8\mathrm{Tr}[ρ_M^2]\approx0.8. Modeling this channel with rates fixed by the measured optical pumping of a single Mn spin, we find that the entanglement it enables is not monotonic in the pump strength: it peaks at a finite rate and then decreases, since the same channel leaks decoherence to the qubits through the coupling that mediates their entanglement. At the experimental pumping rate, a single 8080ns pulse purifies the mediator, the resulting polarization persists for a timescale three orders of magnitude longer than the entangling dynamics, and the first-recurrence negativity rises from 0.180.18 to 0.640.64 at 1212K, remaining above 0.60.6 up to 3030K. These results establish dissipation, not as noise to be suppressed, but as the very resource that makes robust entanglement generation possible.

  • Aritra Lahiri, Florian Marquardt

    Abstract

    Scaling quantum computing toward practical quantum advantage is currently limited by the efficiency of circuits that operate on information encoded by quantum error-correcting codes. The full stack of quantum computing encompasses several tasks: preparation of logical code states, implementation of logical gates, logical routines on encoded qubits, etc. Yet, these circuits are largely designed by hand for individual cases, with some recent works incorporating machine learning for certain aspects. We formulate this problem as agentic evolutionary program synthesis, wherein a large language model, leveraging its pretraining knowledge and tool-use proficiency, and guided by a circuit verifier, evolves a program that defines a Clifford circuit for a wide range of curated tasks such as logical state preparation, logical gate design, and logical routines such as code-switching, code growth, etc. Our approach consistently finds fault-tolerant circuits for all of these tasks, each verified by an exhaustive check over faults.

  • Adnan Jaljuli, Pablo Serra, Ammar Ali, Sabre Kais

    Abstract

    We investigate quantum state transfer in the poly-bi-[8]-annulenylene lattice using isotropic Heisenberg and Hubbard models. For a 16-site lattice, reflection symmetry separates the single-excitation Hamiltonian into independent triplet and singlet sectors, allowing analytical determination of the energy spectra. Although perfect state transfer is forbidden for positive couplings, appropriately chosen coupling ratios enable pretty-good transfer with arbitrarily high fidelity. Remarkably, the triplet transfer probability is independent of the interchain rung coupling, while singlet transfer can be selectively enhanced or suppressed, enabling symmetry-selective quantum transport without time-dependent control. Extending the analysis to the Hubbard model, we show that the Heisenberg transfer dynamics emerge in the strong-interaction limit, while finite interactions delay all high-fidelity transfer peaks of a symmetry sector by the same fraction of their transfer time, set by the spectrum, and reduce the peak fidelity, even at the corrected time, by an amount that grows with the transfer time. These findings are relevant to future quantum-network architectures, where symmetry-controlled state transfer could provide a building block for connecting quantum memories and emitter-based interfaces within quantum nodes. Overall, our results demonstrate how molecular network geometry and symmetry can be exploited to engineer and control quantum-state transport in interacting spin systems, providing a theoretical framework for quantum information transfer in molecular-inspired quantum architectures.

  • Xiangqian Wu, Jannik Gayer, Marcel Wagner, Jan C. Aurich

    Abstract

    Nesting in powder bed fusion (PBF), an additive manufacturing (AM) process, determines the positions and orientations of parts within the build space and influences build height and build time. As the number of parts and feasible placements increases, the nesting problem becomes computationally demanding. Exact approaches are limited to small problem sizes as computational effort increases rapidly with the problem size, while heuristic and metaheuristic approaches involve a trade-off between solution quality and computation time. Quantum annealing (QA) offers an alternative for solving combinatorial optimization problems, but its application to nesting in AM remains largely unexplored. This paper presents a QA-based approach for nesting in AM to investigate its feasibility and its scaling behavior across three problem sizes. An iterative binary quadratic model based approach (IBQM) is developed to minimize build height while considering the geometric characteristics of AM parts. Geometric abstraction, iterative decomposition, and variable pruning are applied to address the computational complexity of the nesting problem. The approach is evaluated using three cases with increasing problem sizes and compared to a classical approach combining tabu search and simulated annealing (TBSA). Compared with TBSA, IBQM reduces the build height of the original parts by up to 13.32% and the computation time by up to 74.27%.

Frequently asked questions

How do I get alerts for new Quantum Physics papers on arXiv?

Create a filter for the quant-ph category — add keywords or authors to narrow it further if you like. Matching papers are delivered to a personal RSS feed, and optionally by immediate, daily, or weekly email digest.

Where does this Quantum Physics paper data come from?

Paper metadata comes directly from arXiv through its official OAI-PMH feed, checked roughly every 15 minutes for new submissions in quant-ph and every other arXiv category.