📊 Today's Data Collection
News items: 15 articles gathered
Technology papers: 10 papers fetched
Company papers: 8 papers from major players
Highlighted papers: 5 papers collected
Total sources: 5 data feeds processed
📰 News Items
−📄 Technology Papers
−Mitigating the sign problem by quantum computing
Kwai-Kong Ng, Min-Fong Yang • Published: 2025-09-16
The notorious sign problem severely limits the applicability of quantum Monte
Carlo (QMC) simulations, as statistical errors grow exponentially with system
size and inverse temperature. A recent proposal of a quantum-computing
stochastic series expansion (qc-SSE) method suggested that the problem could be
avoided by introducing constant energy shifts into the Hamiltonian. Here we
critically examin...
First Practical Experiences Integrating Quantum Computers with HPC Resources: A Case Study With a 20-qubit Superconducting Quantum Computer
Eric Mansfield, Stefan Seegerer, Panu Vesanen, Jorge Echavarria, Burak Mete, Muhammad Nufail Farooqi, Laura Schulz • Published: 2025-09-16
Incorporating Quantum Computers into High Performance Computing (HPC)
environments (commonly referred to as HPC+QC integration) marks a pivotal step
in advancing computational capabilities for scientific research. Here we report
the integration of a superconducting 20-qubit quantum computer into the HPC
infrastructure at Leibniz Supercomputing Centre (LRZ), one of the first
practical implementatio...
Quantum Computing Tools for Fast Detection of Gravitational Waves in the Context of LISA Space Mission
Maria-Catalina Isfan, Laurentiu-Ioan Caramete, Ana Caramete, Daniel Tonoiu, Alexandru Nicolin-Zaczek • Published: 2025-09-16
The field of gravitational wave (GW) detection is progressing rapidly, with
several next-generation observatories on the horizon, including LISA. GW data
is challenging to analyze due to highly variable signals shaped by source
properties and the presence of complex noise. These factors emphasize the need
for robust, advanced analysis tools. In this context, we have initiated the
development of a ...
Extension of the Jordan-Wigner mapping to nonorthogonal spin orbitals for quantum computing application to valence bond approaches
Alessia Marruzzo, Mosè Casalegno, Piero Macchi, Fabio Mascherpa, Bernardino Tirri, Guido Raos, Alessandro Genoni • Published: 2025-09-16
Quantum computing offers a promising platform to address the computational
challenges inherent in quantum chemistry, and particularly in valence bond (VB)
methods, which are chemically appealing but suffer from high computational cost
due to the use of nonorthogonal orbitals. While various fermionic-to-spin
mappings exist for orthonormal spin orbitals, such as the widely used
Jordan-Wigner transfo...
Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
Yingkai Ouyang, Yumang Jing, Gavin K. Brennen • Published: 2024-11-20
Transversal gates on quantum error correction codes have been a promising
approach for fault-tolerant quantum computing, but are limited by the
Eastin-Knill no-go theorem. Existing solutions like gate teleportation and
magic state distillation are resource-intensive. We present a measurement-free
code-switching protocol for universal quantum computation, switching between a
stabiliser code for tra...
Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing
Leo Sünkel, Jonas Stein, Jonas Nüßlein, Tobias Rohe, Claudia Linnhoff-Popien • Published: 2025-09-15
Scaling quantum computers, i.e., quantum processing units (QPUs) to enable
the execution of large quantum circuits is a major challenge, especially for
applications that should provide a quantum advantage over classical algorithms.
One approach to scale QPUs is to connect multiple machines through quantum and
classical channels to form clusters or even quantum networks. Using this
paradigm, severa...
New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
David Miloschewsky, Supartha Podder • Published: 2024-11-06
Aaronson, Bouland, Fitzsimons and Lee introduced the complexity class PDQP
(which was original labeled naCQP), an alteration of BQP enhanced with the
ability to obtain non-collapsing measurements, samples of quantum states
without collapsing them. Although PDQP contains SZK, it still requires
$\Omega(N^{1/4})$ queries to solve unstructured search. We formulate an
alternative equivalent definition ...
Quantum Computation with Correlated Measurements: Implications for the Complexity Landscape
David Miloschewsky, Supartha Podder • Published: 2025-07-04
In 2004, Aaronson introduced the complexity class $\mathsf{PostBQP}$
($\mathsf{BQP}$ with postselection) and showed that it is equal to
$\mathsf{PP}$. In this paper, we define a new complexity class,
$\mathsf{CorrBQP}$, a modification of $\mathsf{BQP}$ which has the power to
perform correlated measurements, i.e. measurements that output the same value
across a partition of registers. We show that ...
Towards a Global Scale Quantum Information Network: A Study Applied to Satellite-Enabled Distributed Quantum Computing
Laurent de Forges de Parny, Luca Paccard, Mathieu Bertrand, Luca Lazzarini, Valentin Leloup, Raphael Aymeric, Agathe Blaise, Stéphanie Molin, Pierre Besancenot, Cyrille Laborde, Mathias van den Bossche • Published: 2025-09-15
Recent developments have reported on the feasibility of interconnecting small
quantum registers in a quantum information network of a few meter-scale for
distributed quantum computing purposes. This multiple small-scale quantum
processors communicating and cooperating to execute computational tasks is
considered as a promising solution to the scalability problem of reaching more
than thousands of ...
Observation of quantum-field-theory dynamics on a spin-phonon quantum computer
Anton T. Than, Saurabh V. Kadam, Vinay Vikramaditya, Nhung H. Nguyen, Xingxin Liu, Zohreh Davoudi, Alaina M. Green, Norbert M. Linke • Published: 2025-09-14
Simulating out-of-equilibrium dynamics of quantum field theories in nature is
challenging with classical methods, but is a promising application for quantum
computers. Unfortunately, simulating interacting bosonic fields involves a high
boson-to-qubit encoding overhead. Furthermore, when mapping to qubits, the
infinite-dimensional Hilbert space of bosons is necessarily truncated, with
truncation e...
🏢 Company Papers
−A Robust Modular Quantum Processor
Ramesh Bhandari • Published: 2025-09-16
We explore the concept of redundancy of critical elements in a quantum
computing architecture to circumvent disruption of quantum operations due to a
failure of such an element, for example, from a catastrophic cosmic ray event.
We illustrate this concept with reference to a recently proposed
superconducting modular quantum architecture with a star-like configuration,
which has a router at the cen...
The impact of kinetic and global effects on ballooning 2nd stable pedestals of conventional and high aspect ratio tokamaks
M. S. Anastopoulos Tzanis, M. Yang, A. Kleiner, J. F. Parisi, G. M. Staebler, P. B. Snyder • Published: 2025-09-15
The EPED model [P.B. Snyder et al 2011 Nucl. Fusion 51 103016] had success in
describing type-I ELM and QH-mode pedestals in conventional tokamaks, by
combining kinetic ballooning mode (KBM) and peeling-ballooning (PB)
constraints. Within EPED, the KBM constraint is usually approximated by the
ideal ballooning mode (IBM) stability threshold. It has been noted that
quantitative differences between ...
Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement: Shor's Algorithm, Constant-Depth CNOT Ladder, and Many-Hypercube Code
Rich Rines, Benjamin Hall, Mariesa H. Teo, Joshua Viszlai, Daniel C. Cole, David Mason, Cameron Barker, Matt J. Bedalov, Matt Blakely, Tobias Bothwell, Caitlin Carnahan, Frederic T. Chong, Samuel Y. Eubanks, Brian Fields, Matthew Gillette, Palash Goiporia, Pranav Gokhale, Garrett T. Hickman, Marin Iliev, Eric B. Jones, Ryan A. Jones, Kevin W. Kuper, Stephanie Lee, Martin T. Lichtman, Kevin Loeffler, Nate Mackintosh, Farhad Majdeteimouri, Peter T. Mitchell, Thomas W. Noel, Ely Novakoski, Victory Omole, David Owusu-Antwi, Alexander G. Radnaev, Anthony Reiter, Mark Saffman, Bharath Thotakura, Teague Tomesh, Ilya Vinogradov • Published: 2025-09-16
Logical qubits are considered an essential component for achieving
utility-scale quantum computation. Multiple recent demonstrations of logical
qubits on neutral atoms have relied on coherent qubit motion into entangling
zones. However, this architecture requires motion prior to every entangling
gate, incurring significant cost in wall clock runtime and motion-related error
accumulation. We propos...
FOSSIL: Regret-minimizing weighting for robust learning under imbalance and small data
J. Cha, J. Lee, J. Cho, J. Shin • Published: 2025-09-16
Imbalanced and small data regimes are pervasive in domains such as rare
disease imaging, genomics, and disaster response, where labeled samples are
scarce and naive augmentation often introduces artifacts. Existing solutions
such as oversampling, focal loss, or meta-weighting address isolated aspects of
this challenge but remain fragile or complex. We introduce FOSSIL (Flexible
Optimization via Sa...
Is Circuit Depth Accurate for Comparing Quantum Circuit Runtimes?
Matthew Tremba, Paul Hovland, Ji Liu • Published: 2025-05-22
Although quantum circuit depth is commonly used to approximate circuit
runtimes, it overlooks a prevailing trait of current hardware implementation:
different gates have different execution times. Recognizing the potential for
discrepancies, we investigate depth's accuracy for comparing runtimes between
compiled versions of the same circuit. In particular, we assess the accuracy of
traditional and...
Fault tolerant Operations in Majorana-based Quantum Codes: Gates, Measurements and High Rate Constructions
Maryam Mudassar, Alexander Schuckert, Daniel Gottesman • Published: 2025-08-13
Majorana-based quantum computation in nanowires and neutral atoms has gained
prominence as a promising platform to encode qubits and protect them against
noise. In order to run computations reliably on such devices, a fully
fault-tolerant scheme is needed for state preparation, gates, and measurements.
However, current fault-tolerant schemes have either been limited to specific
code families or ha...
Towards the Next Generation of Software: Insights from Grey Literature on AI-Native Applications
Lingli Cao, Shanshan Li, Ying Fan, Danyang Li, Chenxing Zhong • Published: 2025-09-16
Background: The rapid advancement of large language models (LLMs) has given
rise to AI-native applications, a new paradigm in software engineering that
fundamentally redefines how software is designed, developed, and evolved.
Despite their growing prominence, AI-native applications still lack a unified
engineering definition and architectural blueprint, leaving practitioners
without systematic gui...
Cultivating T states on the surface code with only two-qubit gates
Jahan Claes • Published: 2025-09-05
High-fidelity T magic states are a key requirement for fault-tolerant quantum
computing in 2D. It has generally been assumed that preparing high-fidelity T
states requires noisy injection of T states followed by lengthy distillation
routines. This assumption has been recently challenged by the introduction of
cultivation, in which careful state injection and postselection alone are used
to prepare...
📚 Highlighted Papers
−Quantum enhanced Monte Carlo simulation for photon interaction cross sections
Authors: Euimin Lee, Sangmin Lee, Shiho Kim • Submitted: Submitted • arXiv: arXiv:2502.14374
Abstract: â¦as the dominant attenuation mechanism, we demonstrate that our approach reproduces classical probability distributions with high fidelity. Simulation results obtained via the IBM Qiskit quantum simulator reveal a quadratic speedup in amplitude estimation compared to conventional Monte C...
Time-adaptive single-shot crosstalk detector on superconducting quantum computer
Authors: Haiyue Kang, Benjamin Harper, Muhammad Usman, Martin Sevior • Submitted: Submitted • arXiv: arXiv:2502.14225
Abstract: â¦in two scenarios: simulation using an artificial noise model with gate-induced crosstalk and always-on idlings channels; and the simulation using noise sampled from an IBM quantum computer parametrised by the reduced HSA error model. The presented results show our method's efficacy hing...
Quantum simulation of a qubit with non-Hermitian Hamiltonian
Authors: Anastashia Jebraeilli, Michael R. Geller • Submitted: Submitted • arXiv: arXiv:2502.13910
Abstract: â¦-broken regime surrounding an exceptional point. Quantum simulations are carried out using IBM superconducting qubits. The results underscore the potential for variational quantum circuits and machine learning to push the boundaries of quantum simulation, offering new methods for explor...
Comment on "Energy-speed relationship of quantum particles challenges Bohmian mechanics"
Aurélien Drezet, Dustin Lazarovici, Bernard Michael Nabet
In their recent paper [Nature 643, 67 (2025)], Sharaglazova et al. report an optical microcavity experiment yielding an "energy-speed relationship" for quantum particles in evanescent states, which they infer from the observed population transfer between two coupled waveguides. The authors argue tha...