Tootfinder

Sequential Quantum Computing
Sebasti\'an V. Romero, Alejandro Gomez Cadavid, Enrique Solano, Narendra N. Hegade
https://arxiv.org/abs/2506.20655 https:…

Sequential Quantum Computing
We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple homogeneous or heterogeneous quantum processors in hybrid classical-quantum workflows. In this manner, we are able to overcome the limitations of each type of quantum computer by combining their complementary strengths. Current quantum devices, including analog quantum annealers and digital quantum processors, offer distinct advantages, yet face significant practical constraints when …

PhasePoly: An Optimization Framework forPhase Polynomials in Quantum Circuits
Zihan Chen, Henry Chen, Yuwei Jin, Minghao Guo, Enhyeok Jang, Jiakang Li, Caitlin Chan, Won Woo Ro, Eddy Z. Zhang
https://arxiv.org/abs/2506.20624

PhasePoly: An Optimization Framework forPhase Polynomials in Quantum Circuits
Quantum computing has transformative computational power to make classically intractable computing feasible. As the algorithms that achieve practical quantum advantage are beyond manual tuning, quantum circuit optimization has become extremely important and integrated into today's quantum software stack. This paper focuses on a critical type of quantum circuit optimization -- phase-polynomial optimization. Phase polynomials represents a class of building-block circuits that appear frequently in…

Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications
Naoki Ishikawa, Giuseppe Thadeu Freitas de Abreu, Petar Popovski, Robert W. Heath Jr
https://arxiv.org/abs/2506.20863

Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications
Quantum computing is poised to redefine the algorithmic foundations of communication systems. While quantum superposition and entanglement enable quadratic or exponential speedups for specific problems, identifying use cases where these advantages yield engineering benefits is, however, still nontrivial. This article presents the fundamentals of quantum computing in a style familiar to the communications society, outlining the current limits of fault-tolerant quantum computing and uncovering a …

Stochastic Quantum Spiking Neural Networks with Quantum Memory and Local Learning
Jiechen Chen, Bipin Rajendran, Osvaldo Simeone
https://arxiv.org/abs/2506.21324

Stochastic Quantum Spiking Neural Networks with Quantum Memory and Local Learning
Neuromorphic and quantum computing have recently emerged as promising paradigms for advancing artificial intelligence, each offering complementary strengths. Neuromorphic systems built on spiking neurons excel at processing time-series data efficiently through sparse, event-driven computation, consuming energy only upon input events. Quantum computing, on the other hand, leverages superposition and entanglement to explore feature spaces that are exponentially large in the number of qubits. Hybr…

A Framework for Quantum Advantage
Olivia Lanes, Mourad Beji, Antonio D. Corcoles, Constantin Dalyac, Jay M. Gambetta, Loic Henriet, Ali Javadi-Abhari, Abhinav Kandala, Antonio Mezzacapo, Christopher Porter, Sarah Sheldon, John Watrous, Christa Zoufal, Alexandre Dauphin, Borja Peropadre
https://arxiv.org/abs/2506.20658

A Framework for Quantum Advantage
As quantum computing approaches the threshold where certain tasks demonstrably outpace their classical machines, the need for a precise, clear, consensus-driven definition of quantum advantage becomes essential. Rapid progress in the field has blurred this term across companies, architectures, and application domains. Here, we aim to articulate an operational definition for quantum advantage that is both platform-agnostic and empirically verifiable. Building on this framework, we highlight the …

Post-Quantum and Blockchain-Based Attestation for Trusted FPGAs in B5G Networks
Ilias Papalamprou, Nikolaos Fotos, Nikolaos Chatzivasileiadis, Anna Angelogianni, Dimosthenis Masouros, Dimitrios Soudris
https://arxiv.org/abs/2506.21073

Post-Quantum and Blockchain-Based Attestation for Trusted FPGAs in B5G Networks
The advent of 5G and beyond has brought increased performance networks, facilitating the deployment of services closer to the user. To meet performance requirements such services require specialized hardware, such as Field Programmable Gate Arrays (FPGAs). However, FPGAs are often deployed in unprotected environments, leaving the user's applications vulnerable to multiple attacks. With the rise of quantum computing, which threatens the integrity of widely-used cryptographic algorithms, the need…

An Improved ChaCha Algorithm Based on Quantum Random Number
Chao Liu, Shuai Zhao, Chenhao Jia, Gengran Hu, Tingting Cui
https://arxiv.org/abs/2507.18157 https://

An Improved ChaCha Algorithm Based on Quantum Random Number
Due to the merits of high efficiency and strong security against timing and side-channel attacks, ChaCha has been widely applied in real-time communication and data streaming scenarios. However, with the rapid development of AI-assisted cryptanalysis and quantum computing technologies, there are serious challenges to the secure implementation of ChaCha cipher. To further strengthen the security of ChaCha cipher, we propose an improved variant based on quantum random numbers, i.e., Quantum Rando…

Generation of polarization-entangled Bell states in monolithic photonic waveguides by leveraging intrinsic crystal properties
Trevor G. Vrckovnik, Dennis Arslan, Falk Eilenberger, Sebastian W. Schmitt
https://arxiv.org/abs/2506.21228

Generation of polarization-entangled Bell states in monolithic photonic waveguides by leveraging intrinsic crystal properties
Advanced photonic quantum technologies -- from quantum key distribution to quantum computing -- require on-chip sources of entangled photons that are both efficient and readily scalable. In this theoretical study, we demonstrate the generation of polarization-entangled Bell states in structurally simple waveguides by exploiting the intrinsic properties of nonlinear crystals. We thereby circumvent elaborate phase-matching strategies that commonly involve the spatial modulation of a waveguide's l…

At Microsoft, we’re advancing quantum computing at every level. With our newly developed family of 4D geometric codes, and our co-designed quantum work with Atom Computing
, we’re getting closer to making large-scale quantum computing a reality. Learn more: https://aka.ms/AQBlogQEC

Microsoft advances quantum error correction with a family of novel four-dimensional codes - Microsoft Azure Quantum Blog
Learn how we're advancing quantum computing by developing 4D error-correction codes that are applicable to many types of qubits.

Challenges and Practices in Quantum Software Testing and Debugging: Insights from Practitioners
Jake Zappin, Trevor Stalnaker, Oscar Chaparro, Denys Poshyvanyk
https://arxiv.org/abs/2506.17306

Challenges and Practices in Quantum Software Testing and Debugging: Insights from Practitioners
Quantum software engineering is an emerging discipline with distinct challenges, particularly in testing and debugging. As quantum computing transitions from theory to implementation, developers face issues not present in classical software development, such as probabilistic execution, limited observability, shallow abstractions, and low awareness of quantum-specific tools. To better understand current practices, we surveyed 26 quantum software developers from academia and industry and conducte…

Advancing Quantum State Preparation using LimTDD
Xin Hong, Aochu Dai, Chenjian Li, Sanjiang Li, Shenggang Ying, Mingsheng Ying
https://arxiv.org/abs/2507.17170 https://

Advancing Quantum State Preparation using LimTDD
Quantum state preparation (QSP) is a fundamental task in quantum computing and quantum information processing. It is critical to the execution of many quantum algorithms, including those in quantum machine learning. In this paper, we propose a family of efficient QSP algorithms tailored to different numbers of available ancilla qubits - ranging from no ancilla qubits, to a single ancilla qubit, to a sufficiently large number of ancilla qubits. Our algorithms are based on a novel decision diagra…

Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit
Alena S. Kazmina, Artyom M. Polyanskiy, Elena Yu. Egorova, Nikolay N. Abramov, Daria A. Kalacheva, Viktor B. Lubsanov, Aleksey N. Bolgar, Ilya A. Simakov
https://arxiv.org/abs/2506.20529

Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit
Quantum error correction (QEC) is essential for achieving fault-tolerant quantum computing. While superconducting qubits are among the most promising candidates for scalable QEC, their limited nearest-neighbor connectivity presents significant challenges for implementing a wide range of error correction codes. In this work, we experimentally demonstrate a quantum error detection scheme that employs a dynamically reassigned ancillary qubit on a chain of three linearly connected transmon qubits. …

exa-AMD: A Scalable Workflow for Accelerating AI-Assisted Materials Discovery and Design
Maxim Moraru, Weiyi Xia, Zhuo Ye, Feng Zhang, Yongxin Yao, Ying Wai Li, Cai-Zhuang Wang
https://arxiv.org/abs/2506.21449

exa-AMD: A Scalable Workflow for Accelerating AI-Assisted Materials Discovery and Design
exa-AMD is a Python-based application designed to accelerate the discovery and design of functional materials by integrating AI/ML tools, materials databases, and quantum mechanical calculations into scalable, high-performance workflows. The execution model of exa-AMD relies on Parsl, a task-parallel programming library that enables a flexible execution of tasks on any computing resource from laptops to supercomputers. By using Parsl, exa-AMD is able to decouple the workflow logic from executio…

It's hard enough to read news articles about quantum computing without it being conflated with other "quantum" research. (e.g. the "quantum compass" being tested as a GPS alternative, isn't quantum computing.)

Rashba spin-orbit coupling and artificially engineered topological superconductors
Sankar Das Sarma, Katharina Laubscher, Haining Pan, Jay D. Sau, Tudor D. Stanescu
https://arxiv.org/abs/2506.21534

Rashba spin-orbit coupling and artificially engineered topological superconductors
One of the most important physical effects in condensed matter physics is the Rashba spin-orbit coupling (RSOC), introduced in seminal works by Emmanuel Rashba. In this article, we discuss, describe, and review (providing critical perspectives on) the crucial role of RSOC in the currently active research area of topological quantum computation. Most, if not all, of the current experimental topological quantum computing platforms use the idea of Majorana zero modes as the qubit ingredient becaus…

Bengaluru-based QpiAI, which is integrating AI and quantum computing for enterprise use cases, raised a $32M Series A at a $162M post-money valuation (Jagmeet Singh/TechCrunch)
https://techcrunch.com/2025/07/16/india-eyes-global-quan…

India eyes global quantum computer push — and QpiAI is its chosen vehicle | TechCrunch
QpiAI, an Indian startup that integrates AI and quantum computing for enterprise use cases, has raised $32 million in a new funding round co-led by the Indian government.

ResQ: A Novel Framework to Implement Residual Neural Networks on Analog Rydberg Atom Quantum Computers
Nicholas S. DiBrita, Jason Han, Tirthak Patel
https://arxiv.org/abs/2506.21537

ResQ: A Novel Framework to Implement Residual Neural Networks on Analog Rydberg Atom Quantum Computers
Research in quantum machine learning has recently proliferated due to the potential of quantum computing to accelerate machine learning. An area of machine learning that has not yet been explored is neural ordinary differential equation (neural ODE) based residual neural networks (ResNets), which aim to improve the effectiveness of neural networks using the principles of ordinary differential equations. In this work, we present our insights about why analog Rydberg atom quantum computers are es…

Forget ransomware - most firms think quantum computing is the biggest security risk to come: Quantum computers will break modern encryption sooner or later.
🔓 https://www.techradar.com/pro/security/for

Forget ransomware - most firms think quantum computing is the biggest security risk to come
Quantum computers will break modern encryption sooner or later

Integrating Classical and Quantum Software for Enhanced Simulation of Realistic Chemical Systems
Tomoya Shiota, Klaas Gunst, Toshio Mori, Toru Shiozaki, Wataru Mizukami
https://arxiv.org/abs/2506.18877

Integrating Classical and Quantum Software for Enhanced Simulation of Realistic Chemical Systems
We demonstrate the feasibility of quantum computing for large-scale, realistic chemical systems through the development of a new interface using a quantum circuit simulator and CP2K, a highly efficient first-principles calculation software. Quantum chemistry calculations using quantum computers require Hamiltonians prepared on classical computers. Moreover, to compute forces beyond just single-point energy calculations, one- and two-electron integral derivatives and response equations are also …

Improving the lifetime of aluminum-based superconducting qubits through atomic layer etching and deposition
Neha Mahuli (AWS Center for Quantum Computing, Pasadena, CA, USA), Joaquin Minguzzi (AWS Center for Quantum Computing, Pasadena, CA, USA), Jiansong Gao (AWS Center for Quantum Computing, Pasadena, CA, USA), Rachel Resnick (Google Research), Sandra Diez (National Institute of Standards and Technology), Cosmic Raj (AWS Center for Quantum Computing, Pasadena, CA, USA), Guillaume Mar…

Improving the lifetime of aluminum-based superconducting qubits through atomic layer etching and deposition
We present a dry surface treatment combining atomic layer etching and deposition (ALE and ALD) to mitigate dielectric loss in fully fabricated superconducting quantum devices formed from aluminum thin films on silicon. The treatment, performed as a final processing step prior to device packaging, starts by conformally removing the native metal oxide and fabrication residues from the exposed surfaces through ALE before \textit{in situ} encapsulating the metal surfaces with a thin dielectric laye…

Entanglement Entropy of Quantum Corners
Luca Ciambelli, Jerzy Kowalski-Glikman, Ludovic Varrin
https://arxiv.org/abs/2507.16800 https://

Entanglement Entropy of Quantum Corners
In gravitational theories with boundaries, diffeomorphisms can become physical and acquire a non-vanishing Noether charge. Using the covariant phase space formalism, on shell of the gravitational constraints, the latter localizes on codimension-$2$ surfaces, the corners. The corner proposal asserts that these charges, and their algebras, must be important ingredients of any quantum gravity theory. In this manuscript, we continue the study of quantum corner symmetries and algebras by computing t…

Algorithms for variational Monte Carlo calculations of fermion PEPS in the swap gates formulation
Yantao Wu, Zhehao Dai
https://arxiv.org/abs/2506.20106 ht…

Algorithms for variational Monte Carlo calculations of fermion PEPS in the swap gates formulation
In recent years, the variational Monte Carlo (VMC) calculations of projected entangled pair states (PEPS) has emerged as a competitive method for computing the ground states of many-body quantum systems. This method is particularly important for fermion systems where sign problems are abundant. We derive and explain the algorithms for the VMC calculations of fermion PEPS in the swap gates formulation. It is the purpose of this paper to be as concise and precise as possible. Diagramatic tensor n…

Symmetry-Checking in Band Structure Calculations on a Noisy Quantum Computer
Shaobo Zhang, Akib Karim, Harry M. Quiney, Muhammad Usman
https://arxiv.org/abs/2506.20483

Symmetry-Checking in Band Structure Calculations on a Noisy Quantum Computer
Band crossings in electronic band structures play an important role in determining the electronic, topological, and transport properties in solid-state systems, making them central to both condensed matter physics and materials science. The emergence of noisy intermediate-scale quantum (NISQ) processors has sparked great interest in developing quantum algorithms to compute band structure properties of materials. While significant research has been reported on computing ground state and excited …

Introducing Quantum Computing to High-School Curricula: A Global Perspective
Mar\'ia Gragera Garc\'es, Luis G\'omez Orzechowski, Juan Francisco Rodr\'iguez Hern\'andez
https://arxiv.org/abs/2505.14809

Introducing Quantum Computing to High-School Curricula: A Global Perspective
Quantum computing is an emerging field with growing implications across science and industry, making early educational exposure increasingly important. This paper examines how quantum computing concepts can be introduced into high-school STEM curricula within existing structures to enhance foundational learning in mathematics, computer science, and physics. We outline a modular integration strategy introducing key quantum ideas into standard courses, leveraging open-source educational resources…

Earlier this week, Peter Gutmann and @… published a bombshell paper: The looked at all the reported factorization "breakthroughs" in quantum computing. And found that all of them essentially were magician's tricks, "sleight of hand".
The two reconstructed the algorithms used on a 1981 home computer (a million times less powerful than what you…

Analysis of Post-Quantum Cryptography in User Equipment in 5G and Beyond
Sanzida Hoque, Abdullah Aydeger, Engin Zeydan, Madhusanka Liyanage
https://arxiv.org/abs/2507.17074 http…

Analysis of Post-Quantum Cryptography in User Equipment in 5G and Beyond
The advent of quantum computing threatens the security of classical public-key cryptographic systems, prompting the transition to post-quantum cryptography (PQC). While PQC has been analyzed in theory, its performance in practical wireless communication environments remains underexplored. This paper presents a detailed implementation and performance evaluation of NIST-selected PQC algorithms in user equipment (UE) to UE communications over 5G networks. Using a full 5G emulation stack (Open5GS a…

BZ109 Quantum Computing – https://buzzzoom.de/109/
Was ist eigentlich Quantum Computing?

A quantum algorithm for the n-gluon MHV scattering amplitude
Erik Bashore, Stefano Moretti, Timea Vitos
https://arxiv.org/abs/2507.14252 https://

A quantum algorithm for the n-gluon MHV scattering amplitude
We propose a quantum algorithm for computing the n-gluon maximally helicity violating (MHV) tree-level scattering amplitude. We revisit a newly proposed method for unitarisation of non-unitary operations and present how this implementation can be used to create quantum gates responsible for the color and kinematic factors of the gluon scattering amplitude. As a proof-of-concept, we detail the full conceptual algorithm that yields the squared amplitude and implement the corresponding building bl…

Hermitian hull of some GRS codes and new EAQMDS codes
Oisin Campion, Rodrigo San-Jos\'e
https://arxiv.org/abs/2507.18361 https://arxiv.org/pdf/2507.183…

Hermitian hull of some GRS codes and new EAQMDS codes
We study the Hermitian hull of a particular family of generalized Reed-Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas for the dimension of the hull, which determines the minimum number required of maximally entangled pairs for the associated entanglement-assisted quantum error-correcting codes. This flexible construction allows to obtain a wide range of entanglement-assiste…

Stability Analysis of Three Coupled Kerr Oscillators: Implications for Quantum Computing
K. Chmielewski, K. Grygiel, K. Bartkiewicz
https://arxiv.org/abs/2506.19145

Stability Analysis of Three Coupled Kerr Oscillators: Implications for Quantum Computing
We investigate the classical dynamics of optical nonlinear Kerr couplers, focusing on their potential relevance to quantum computing applications. The system consists of three Kerr-type nonlinear oscillators arranged in two configurations: a triangular arrangement, where each oscillator is coupled to the others, and a sandwich arrangement, where only the middle oscillator interacts with the two outer ones. The system is driven by an external periodic field and includes dissipative processes. It…

Tight Success Probabilities for Quantum Period Finding and Phase Estimation
Malik Magdon-Ismail, Khai Dong
https://arxiv.org/abs/2506.20527 https://…

Tight Success Probabilities for Quantum Period Finding and Phase Estimation
Period finding and phase estimation are fundamental in quantum computing. Prior work has established lower bounds on their success probabilities. We improve these results by deriving tight upper and lower bounds on the success probability that converge to 1.

A Quantum Approach for Optimal Transient Control in Network-Based Epidemic Models
Deborah Volpe, Giacomo Orlandi, Mattia Boggio, Carlo Novara, Lorenzo Zino, Giovanna Turvani
https://arxiv.org/abs/2507.15989

A Quantum Approach for Optimal Transient Control in Network-Based Epidemic Models
Effective epidemic control is crucial for mitigating the spread of infectious diseases, particularly when pharmaceutical interventions such as vaccines or treatments are limited. Non-pharmaceutical strategies, including mobility restrictions, are key in reducing transmission rates but require careful optimization to balance public health benefits and socioeconomic costs. Quantum computing is emerging as a powerful tool for solving complex optimization problems that are intractable for classical…

Quantum Optimization for Software Engineering: A Survey
Man Zhang, Yuechen Li, Tao Yue, Kai-Yuan Cai
https://arxiv.org/abs/2506.16878 https://

Quantum Optimization for Software Engineering: A Survey
Quantum computing, particularly in the area of quantum optimization, is steadily progressing toward practical applications, supported by an expanding range of hardware platforms and simulators. While Software Engineering (SE) optimization has a strong foundation, which is exemplified by the active Search-Based Software Engineering (SBSE) community and numerous classical optimization methods, the growing complexity of modern software systems and their engineering processes demands innovative sol…

A quantum internet is much closer to reality thanks to the world's first operating system for quantum computers - https://www.livescience.com/technology/computing/worlds-…

Quantum Assisted Ghost Gutzwiller Ansatz
P. V. Sriluckshmy, Fran\c{c}ois Jamet, Fedor \v{S}imkovic IV
https://arxiv.org/abs/2506.21431 https://

Quantum Assisted Ghost Gutzwiller Ansatz
The ghost Gutzwiller ansatz (gGut) embedding technique was shown to achieve comparable accuracy to the gold standard dynamical mean-field theory method in simulating real material properties, yet at a much lower computational cost. Despite that, gGut is limited by the algorithmic bottleneck of computing the density matrix of the underlying effective embedding model, a quantity which must be converged within a self-consistent embedding loop. We develop a hybrid quantum-classical gGut technique w…

Towards Quantum Accelerated Large-scale Topology Optimization
Zisheng Ye, Wenxiao Pan
https://arxiv.org/abs/2507.14478 https://arxiv.…

Towards Quantum Accelerated Large-scale Topology Optimization
We present a new method that efficiently solves TO problems and provides a practical pathway to leverage quantum computing to exploit potential quantum advantages. This work targets on large-scale, multi-material TO challenges for three-dimensional (3D) continuum structures, beyond what have been addressed in prior studies. Central to this new method is the modified Dantzig-Wolfe (MDW) decomposition, which effectively mitigates the escalating computational cost associated with using classical M…

Superfluid stiffness bounds in time-reversal symmetric superconductors
Yongxin Zeng, Andrew J. Millis
https://arxiv.org/abs/2506.18081 https://

Superfluid stiffness bounds in time-reversal symmetric superconductors
Quantum geometry has been shown to make an important contribution to the superfluid stiffness of superconductors, especially for flat-band systems such as moiré materials. In this work we use mean-field theory to derive an expression for the superfluid stiffness of time-reversal symmetric superconductors at zero temperature by computing the energy of the mean-field ground state as a function of pairing momentum. We show that the quantum geometric contribution to superfluid stiffness is a conse…

Quantum Blockchain Survey: Foundations, Trends, and Gaps
Saurav Ghosh
https://arxiv.org/abs/2507.13720 https://arxiv.org/pdf/2507.137…

Quantum Blockchain Survey: Foundations, Trends, and Gaps
Quantum computing poses fundamental risks to classical blockchain systems by undermining widely used cryptographic primitives. In response, two major research directions have emerged: post-quantum blockchains, which integrate quantum-resistant algorithms, and quantum blockchains, which leverage quantum properties such as entanglement and quantum key distribution. This survey reviews key developments in both areas, analyzing their cryptographic foundations, architectural designs, and implementat…

TASI/CERN/KITP Lecture Notes on "Toward Quantum Computing Gauge Theories of Nature"
Zohreh Davoudi
https://arxiv.org/abs/2507.15840 https://arxiv…

TASI/CERN/KITP Lecture Notes on "Toward Quantum Computing Gauge Theories of Nature"
A hallmark of the computational campaign in nuclear and particle physics is the lattice-gauge-theory program. It continues to enable theoretical predictions for a range of phenomena in nature from the underlying Standard Model. The emergence of a new computational paradigm based on quantum computing, therefore, can introduce further advances in this program. In particular, it is believed that quantum computing will make possible first-principles studies of matter at extreme densities, and in an…

The Goldilocks zone of governing technology: Leveraging uncertainty for responsible quantum practices
Miriam Meckel, Philipp Hacker, Lea Steinacker, Aurelija Lukoseviciene, Surjo R. Soekadar, Jacob Slosser, Gina-Maria Poehlmann
https://arxiv.org/abs/2507.12957

The Goldilocks zone of governing technology: Leveraging uncertainty for responsible quantum practices
Emerging technologies challenge conventional governance approaches, especially when uncertainty is not a temporary obstacle but a foundational feature as in quantum computing. This paper reframes uncertainty from a governance liability to a generative force, using the paradigms of quantum mechanics to propose adaptive, probabilistic frameworks for responsible innovation. We identify three interdependent layers of uncertainty--physical, technical, and societal--central to the evolution of quantu…

This https://arxiv.org/abs/2505.11862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Q-Policy: Quantum-Enhanced Policy Evaluation for Scalable Reinforcement Learning
We propose Q-Policy, a hybrid quantum-classical reinforcement learning (RL) framework that mathematically accelerates policy evaluation and optimization by exploiting quantum computing primitives. Q-Policy encodes value functions in quantum superposition, enabling simultaneous evaluation of multiple state-action pairs via amplitude encoding and quantum parallelism. We introduce a quantum-enhanced policy iteration algorithm with provable polynomial reductions in sample complexity for the evaluat…

Efficient Inversion of Unknown Unitary Operations with Structured Hamiltonians
Yin Mo, Tengxiang Lin, Xin Wang
https://arxiv.org/abs/2506.20570 https://

Efficient Inversion of Unknown Unitary Operations with Structured Hamiltonians
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions, improving the efficiency of such protocols remains an open question. In this work, we present efficient quantum algorithms for inverting unitaries with specific Hamiltonian structures, achieving significant reductions in both ancilla qubit requirements and unitar…

"New technologies, when introduced, are typically given names that overstate their capabilities, usually by equating them with existing familiar systems or technological artefacts. For example the first computers in the 1940s and 1950s, often little more than glorified electric adding machines, were nevertheless described as “electronic brains”. More recently, large language models (LLMs) have been touted as “artificial intelligence”, and complex physics experiments have been touted as …

Spain-based Multiverse Computing, which makes tools to compress LLMs by up to 95% using "quantum-inspired" networks, raised a €189M Series B and has 100 clients (Julie Bort/TechCrunch)
https://techcrunch.com/2025/06/12/mult

Multiverse Computing raises $215M for tech that could radically slim AI costs | TechCrunch
Spanish startup Multiverse Computing announced that it raised an enormous Series B round on the strength of a technology it calls “CompactifAI.”

High-fidelity collisional quantum gates with fermionic atoms
Petar Bojovi\'c, Timon Hilker, Si Wang, Johannes Obermeyer, Marnix Barendregt, Dorothee Tell, Thomas Chalopin, Philipp M. Preiss, Immanuel Bloch, Titus Franz
https://arxiv.org/abs/2506.14711

High-fidelity collisional quantum gates with fermionic atoms
Quantum simulations of electronic structure and strongly correlated quantum phases are widely regarded as among the most promising applications of quantum computing. These simulations require the accurate implementation of motion and entanglement of fermionic particles. Instead of the commonly applied costly mapping to qubits, fermionic quantum computers offer the prospect of directly implementing electronic structure problems. Ultracold neutral atoms have emerged as a powerful platform for spi…

Quantum Software Security Challenges within Shared Quantum Computing Environments
Samuel Ovaskainen, Majid Haghparast, Tommi Mikkonen
https://arxiv.org/abs/2507.17712 https://…

Quantum Software Security Challenges within Shared Quantum Computing Environments
The number of qubits in quantum computers keeps growing, but most quantum programs remain relatively small because of the noisy nature of the underlying quantum hardware. This might lead quantum cloud providers to explore increased hardware utilization, and thus profitability through means such as multi-programming, which would allow the execution of multiple programs in parallel. The adoption of such technology would bring entirely new challenges to the field of quantum software security. This…

Encrypted-State Quantum Compilation Scheme Based on Quantum Circuit Obfuscation
Chenyi Zhang, Tao Shang, Xueyi Guo
https://arxiv.org/abs/2507.17589 https://

Encrypted-State Quantum Compilation Scheme Based on Quantum Circuit Obfuscation
With the rapid advancement of quantum computing, quantum compilation has become a crucial layer connecting high-level algorithms with physical hardware. In quantum cloud computing, compilation is performed on the cloud side, which exposes user circuits to potential risks such as structural leakage and output predictability. To address these issues, we propose the encrypted-state quantum compilation scheme based on quantum circuit obfuscation (ECQCO), the first secure compilation framework tailo…

Decision Models for Selecting Architecture Patterns and Strategies in Quantum Software Systems
Mst Shamima Aktar, Peng Liang, Muhammad Waseem, Amjed Tahir, Mojtaba Shahin, Muhammad Azeem Akbar, Arif Ali Khan, Aakash Ahmad, Musengamana Jean de Dieu, Ruiyin Li
https://arxiv.org/abs/2507.11671

Decision Models for Selecting Architecture Patterns and Strategies in Quantum Software Systems
Quantum software represents disruptive technologies in terms of quantum-specific software systems, services, and applications - leverage the principles of quantum mechanics via programmable quantum bits (Qubits) that manipulate quantum gates (QuGates) - to achieve quantum supremacy in computing. Quantum software architecture enables quantum software developers to abstract away implementation-specific details (i.e., mapping of Qubits and QuGates to high-level architectural components and connect…

Dynamics of discrete spacetimes with Quantum-enhanced Markov Chain Monte Carlo
Stuart Ferguson, Arad Nasiri, Petros Wallden
https://arxiv.org/abs/2506.19538

Dynamics of discrete spacetimes with Quantum-enhanced Markov Chain Monte Carlo
Quantum algorithms offer the potential for significant computational advantages; however, in many cases, it remains unclear how these advantages can be practically realized. Causal Set Theory is a discrete, Lorentz-invariant approach to quantum gravity which may be well positioned to benefit from quantum computing. In this work, we introduce a quantum algorithm that investigates the dynamics of causal sets by sampling the space of causal sets, improving on classical methods. Our approach builds…

Critical point search and linear response theory for computing electronic excitation energies of molecular systems. Part I: General framework, application to Hartree-Fock and DFT
Laura Grazioli, Yukuan Hu, Eric Canc\`es
https://arxiv.org/abs/2506.16420

Critical point search and linear response theory for computing electronic excitation energies of molecular systems. Part I: General framework, application to Hartree-Fock and DFT
Computing excited states of many-body quantum Hamiltonians is a fundamental challenge in computational physics and chemistry, with state-of-the-art methods broadly classified into variational (critical point search) and linear response approaches. This article introduces a unified framework based on the Kähler manifold formalism, which naturally accommodates both strategies for a wide range of variational models, including Hartree-Fock, CASSCF, Full CI, and adiabatic TDDFT. In particular, this…

POPQC: Parallel Optimization for Quantum Circuits (Extended Version)
Pengyu Liu, Jatin Arora, Mingkuan Xu, Umut A. Acar
https://arxiv.org/abs/2506.13720 ht…

POPQC: Parallel Optimization for Quantum Circuits (Extended Version)
Optimization of quantum programs or circuits is a fundamental problem in quantum computing and remains a major challenge. State-of-the-art quantum circuit optimizers rely on heuristics and typically require superlinear, and even exponential, time. Recent work proposed a new approach that pursues a weaker form of optimality called local optimality. Parameterized by a natural number $Ω$, local optimality insists that each and every $Ω$-segment of the circuit is optimal with respect to an extern…

Spatial Regionalization: A Hybrid Quantum Computing Approach
Yunhan Chang, Amr Magdy, Federico M. Spedalieri, Ibrahim Sabek
https://arxiv.org/abs/2506.18799

Spatial Regionalization: A Hybrid Quantum Computing Approach
Quantum computing has shown significant potential to address complex optimization problems; however, its application remains confined to specific problems at limited scales. Spatial regionalization remains largely unexplored in quantum computing due to its complexity and large number of variables. In this paper, we introduce the first hybrid quantum-classical method to spatial regionalization by decomposing the problem into manageable subproblems, leveraging the strengths of both classical and …

Enhancement of Indistinguishable Photon Emission from a GaAs Quantum Dot via Charge Noise Suppression
Priyabrata Mudi, Avijit Barua, Kartik Gaur, Steffen Wilksen, Alexander Steinhoff, Setthanat Wijitpatima, Sarthak Tripathi, Julian Ritzmann, Andreas D. Wieck, Sven Rodt, Christopher Gies, Arne Ludwig, Stephan Reitzenstein
https://

Enhancement of Indistinguishable Photon Emission from a GaAs Quantum Dot via Charge Noise Suppression
The generation of indistinguishable single photons is a fundamental requirement for future quantum technologies, particularly in quantum repeater networks and for distributed quantum computing based on entanglement distribution. However, spectral jitter, often induced by charge noise in epitaxial quantum dots, leads to exciton dephasing, thereby limiting their practical usage in quantum applications. We present a straightforward approach to mitigate charge noise-induced decoherence in droplet-e…

Beyond Decoherence: Control the Collective Quantum Dynamics of Quasi Particles in Topological Interface
Fatemeh Davoodi
https://arxiv.org/abs/2506.12805 ht…

Beyond Decoherence: Control the Collective Quantum Dynamics of Quasi Particles in Topological Interface
Long lived coherent quasiparticles are a promising foundation for novel quantum technologies, where maintaining quantum coherence is crucial. Decoherence, driven by finite emitter lifetimes, remains a central challenge in quantum computing. Here, we control the dynamics of spatially separated quantum emitters via preserving their phase information by introducing a topological waveguide as a robust chiral reservoir. Incoherent quantum emitters randomly positioned near a perturbed honeycomb plasm…

Noise-tolerant tomography of multimode linear optical interferometers with single photons
Yu. A. Biriukov, R. D. Morozov, I. V. Dyakonov, M. V. Rakhlin, A. I. Galimov, G. V. Klimko, S. V. Sorokin, I. V. Sedova, M. M. Kulagina, Yu. M. Zadiranov, A. A. Toropov, A. A. Korneev, S. P. Kulik, S. S. Straupe
https://arxiv.org/abs/2506.2…

Noise-tolerant tomography of multimode linear optical interferometers with single photons
Linear optical networks are fundamental to the advancement of quantum technologies, including quantum computing, communication, and sensing. The accurate characterization of these networks, described by unitary matrices, is crucial to their effective utilization and scalability. In this work, we present the method for reconstructing the transfer matrix of a linear optical interferometer based on the analysis of cross-correlation functions of photon counts between pairs of output modes. Our appr…

Quantum Machine Learning for Predicting Binding Free Energies in Structure-Based Virtual Screening
Pei-Kun Yang
https://arxiv.org/abs/2507.18425 https://ar…

Quantum Machine Learning for Predicting Binding Free Energies in Structure-Based Virtual Screening
In structure-based virtual screening, it is often necessary to evaluate the binding free energy of protein-ligand complexes by considering not only molecular conformations but also how these structures shift and rotate in space. The number of possible combinations grows rapidly and can become overwhelming. While classical computing has limitations in this context, quantum computing offers a promising alternative due to its inherent parallelism. In this study, we introduce a quantum machine lear…

Watermarking Quantum Neural Networks Based on Sample Grouped and Paired Training
Limengnan Zhou, Hanzhou Wu
https://arxiv.org/abs/2506.12675 https://

Watermarking Quantum Neural Networks Based on Sample Grouped and Paired Training
Quantum neural networks (QNNs) leverage quantum computing to create powerful and efficient artificial intelligence models capable of solving complex problems significantly faster than traditional computers. With the fast development of quantum hardware technology, such as superconducting qubits, trapped ions, and integrated photonics, quantum computers may become reality, accelerating the applications of QNNs. However, preparing quantum circuits and optimizing parameters for QNNs require quantu…

Quantum Resource Theories of Anyonic Entanglement
Wenhao Ye, Li You, Cheng-Qian Xu
https://arxiv.org/abs/2506.19735 https://arxiv.org…

Quantum Resource Theories of Anyonic Entanglement
As information carriers for fault-tolerant quantum computing, systems composed of anyons exhibit non-tensor product state spaces due to their distinctive fusion rules, leading to fundamentally different entanglement properties from conventional quantum systems. However, a quantitative characterization of entanglement for general anyonic states remains elusive. In this Letter, within the framework of resource theory, we propose three measures that quantify total entanglement, conventional entang…

Maryland-based quantum computing company IonQ agrees to acquire Oxford Ionics, which spun out of Oxford University, in a $1.07B all-stock deal, closing in 2025 (Oliver Barnes/Financial Times)
https://www.ft.com/content/dde7bac2-cacb-4deb-9223-5bcfe285db15

US quantum computing company IonQ to buy Oxford university start-up
Acquisition of Oxford Ionics for $1.1bn shows advances in processing are kick-starting dealmaking

LLM-Powered Quantum Code Transpilation
Nazanin Siavash, Armin Moin
https://arxiv.org/abs/2507.12480 https://arxiv.org/pdf/2507.12480

LLM-Powered Quantum Code Transpilation
There exist various Software Development Kits (SDKs) tailored to different quantum computing platforms. These are known as Quantum SDKs (QSDKs). Examples include but are not limited to Qiskit, Cirq, and PennyLane. However, this diversity presents significant challenges for interoperability and cross-platform development of hybrid quantum-classical software systems. Traditional rule-based transpilers for translating code between QSDKs are time-consuming to design and maintain, requiring deep exp…

High-precision Quantum Phase Estimation on a Trapped-ion Quantum Computer
Andrew Tranter, Duncan Gowland, Kentaro Yamamoto, Michelle Sze, David Mu\~noz Ramo
https://arxiv.org/abs/2506.17207

High-precision Quantum Phase Estimation on a Trapped-ion Quantum Computer
Emergent quantum computing technologies are widely expected to provide novel approaches in the simulation of quantum chemistry. Despite rapid improvements in the scale and fidelity of quantum computers, high resource requirements make the execution of quantum chemistry experiments challenging. Typical experiments are limited in the number of qubits used, incur a substantial shot cost, or require complex architecture-specific optimization and error mitigation techniques. In this paper, we propos…

No Scratch Quantum Computing by Reducing Qubit Overhead for Efficient Arithmetics
Omid Faizy, Norbert Wehn, Paul Lukowicz, Maximilian Kiefer-Emmanouilidis
https://arxiv.org/abs/2506.17135

No Scratch Quantum Computing by Reducing Qubit Overhead for Efficient Arithmetics
Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state encoding. Quantum Hamiltonian Computing (QHC) introduces a novel approach by encoding input for logic operations within a single rotating quantum gate. This innovation reduces the required qubit register $ N $ to the size of the output states $ O $, where $ …

Comparing performance of variational quantum algorithm simulations on HPC systems
Marco De Pascale, Tobias Valentin Bauer, Yaknan John Gambo, Mario Hern\'andez Vera, Stefan Huber, Burak Mete, Amit Jamadagni, Amine Bentellis, Marita Oliv, Luigi Iapichino, Jeanette Miriam Lorenz
https://arxiv.org/abs/2507.17614

Comparing performance of variational quantum algorithm simulations on HPC systems
Variational quantum algorithms are of special importance in the research on quantum computing applications because of their applicability to current Noisy Intermediate-Scale Quantum (NISQ) devices. The main building blocks of these algorithms (among them, the definition of the Hamiltonian and of the ansatz, the optimizer) define a relatively large parameter space, making the comparison of results and performance between different approaches and software simulators cumbersome and prone to errors…

Boulder, CO-based quantum computing startup Infleqtion raised a $100M Series C and partnered with US government services contractor SAIC to pursue defense deals (Stephen Nellis/Reuters)
https://www.reuters.com/technology/quantum

Cyclicity of interaction frame transformations
Michael C D Tayler, Mohamed Sabba
https://arxiv.org/abs/2506.20594 https://arxiv.org/p…

Cyclicity of interaction frame transformations
We identify a cyclic property of rotation sequences involving piecewise displacements $β$ about arbitrary axes in three dimensions. Specifically, when transformation to the toggling frame is applied successively $m$ times, for $β=2π/m$ the original sequence returns. This main result unites several families of rotation sequences used for error-tuned control across quantum technologies, from NMR and MRI to atomic clocks and atom-scale computing. For the widest class of cycle, $m=2$, we highlig…

Secure Data Access in Cloud Environments Using Quantum Cryptography
S. Vasavi Venkata Lakshmi, Ziaul Haque Choudhury
https://arxiv.org/abs/2506.10028 https…

Secure Data Access in Cloud Environments Using Quantum Cryptography
Cloud computing has made storing and accessing data easier but keeping it secure is a big challenge nowadays. Traditional methods of ensuring data may not be strong enough in the future when powerful quantum computers become available. To solve this problem, this study uses quantum cryptography to protect data in the cloud environment. Quantum Key Distribution (QKD) creates secure keys by sending information using quantum particles like photons. Specifically, we use the BB84 protocol, a simple …

Hybrid Reward-Driven Reinforcement Learning for Efficient Quantum Circuit Synthesis
Sara Giordano, Kornikar Sen, Miguel A. Martin-Delgado
https://arxiv.org/abs/2507.16641

Hybrid Reward-Driven Reinforcement Learning for Efficient Quantum Circuit Synthesis
A reinforcement learning (RL) framework is introduced for the efficient synthesis of quantum circuits that generate specified target quantum states from a fixed initial state, addressing a central challenge in both the NISQ era and future fault-tolerant quantum computing. The approach utilizes tabular Q-learning, based on action sequences, within a discretized quantum state space, to effectively manage the exponential growth of the space dimension. The framework introduces a hybrid reward mecha…

On the Differential Topology of Expressivity of Parameterized Quantum Circuits
Johanna Barzen, Frank Leymann
https://arxiv.org/abs/2507.16401 https://

On the Differential Topology of Expressivity of Parameterized Quantum Circuits
Parameterized quantum circuits play a key role in quantum computing. Measuring the suitability of such a circuit for solving a class of problems is needed. One such promising measure is the expressivity of a circuit, which is defined in two main variants. The variant in focus of this contribution is the so-called dimensional expressivity which measures the dimension of the submanifold of states produced by the circuit. Understanding this measure needs a lot of background from differential topol…

Application-Driven Benchmarking of the Traveling Salesperson Problem: a Quantum Hardware Deep-Dive
Amine Bentellis, Benedikt Poggel, Jeanette Miriam Lorenz
https://arxiv.org/abs/2507.16471

Application-Driven Benchmarking of the Traveling Salesperson Problem: a Quantum Hardware Deep-Dive
The potential analysis of the capabilities of quantum computing, especially before fault tolerance at scale, is difficult due to the variety of existing hardware technologies with a wide spread of maturity. Not only the result of computations, but also the very process of running quantum-enhanced algorithms differ from provider to provider. The study includes a comparative analysis of various hardware architectures with the example of the Traveling Salesperson Problem, a central class of combin…

Sporadic Federated Learning Approach in Quantum Environment to Tackle Quantum Noise
Ratun Rahman, Atit Pokharel, Dinh C. Nguyen
https://arxiv.org/abs/2507.12492

Sporadic Federated Learning Approach in Quantum Environment to Tackle Quantum Noise
Quantum Federated Learning (QFL) is an emerging paradigm that combines quantum computing and federated learning (FL) to enable decentralized model training while maintaining data privacy over quantum networks. However, quantum noise remains a significant barrier in QFL, since modern quantum devices experience heterogeneous noise levels due to variances in hardware quality and sensitivity to quantum decoherence, resulting in inadequate training performance. To address this issue, we propose SpoQ…

Enhanced Image Recognition Using Gaussian Boson Sampling
Si-Qiu Gong, Ming-Cheng Chen, Hua-Liang Liu, Hao Su, Yi-Chao Gu, Hao-Yang Tang, Meng-Hao Jia, Yu-Hao Deng, Qian Wei, Hui Wang, Han-Sen Zhong, Xiao Jiang, Li Li, Nai-Le Liu, Chao-Yang Lu, Jian-Wei Pan
https://arxiv.org/abs/2506.19707

Enhanced Image Recognition Using Gaussian Boson Sampling
Gaussian boson sampling (GBS) has emerged as a promising quantum computing paradigm, demonstrating its potential in various applications. However, most existing works focus on theoretical aspects or simple tasks, with limited exploration of its capabilities in solving real-world practical problems. In this work, we propose a novel GBS-based image recognition scheme inspired by extreme learning machine (ELM) to enhance the performance of perceptron and implement it using our latest GBS device, J…

What is a good use case for quantum computers?
Michael Marthaler, Peter Pinski, Pascal Stadler, Vladimir Rybkin, Marina Walt
https://arxiv.org/abs/2506.15426

What is a good use case for quantum computers?
Identify, Transform, Benchmark, Show Quantum Advantage (ITBQ): Evaluating use cases for quantum computers. We introduce a four-step framework for assessing quantum computing applications -- from identifying relevant industry problems to demonstrating quantum advantage -- addressing steps often overlooked in the literature, such as rigorous benchmarking against classical solutions and the challenge of translating real-world tasks onto quantum hardware. Applying this framework to cases like NMR, …

One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States
Nyau Fisn, Houren Fu
https://arxiv.org/abs/2506.14257 https://

One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States
Quantum computing has attracted a lot of attention in recent years. It is one of the promising candidates for the next-generation computing paradigms. Basically, there are two technical lines to realize quantum computing. One is composing the unitary operators of a few qubits to achieve general unitary operators on an arbitrary number of qubits, known as the approach of quantum circuits. The other one focuses on preparing quantum cluster states and performing the computation by measuring the st…

On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
Pau Escofet, Abhijit Das, Sahar Ben Rached, Santiago Rodrigo, Jordi Domingo, Fabio Sebastiano, Masoud Babaie, Batuhan Keskin, Edoardo Charbon, Peter Haring Bol\'ivar, Maurizio Palesi, Elena Blokhina, Bogdan Staszewski, Avishek Nag, Artur Garcia-S\'aez, Sergi Abadal, Eduard Alarc\'on, Carmen G. Almud\'ever

On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
Modular architectures are a promising approach to scaling quantum computers beyond the limits of monolithic designs. However, non-local communications between different quantum processors might significantly impact overall system performance. In this work, we investigate the role of the network infrastructure in modular quantum computing architectures, focusing on coherence loss due to communication constraints. We analyze the impact of classical network latency on quantum teleportation and ide…

Understanding Quantum Information and Computation
John Watrous
https://arxiv.org/abs/2507.11536 https://arxiv.org/pdf/2507.11536

Understanding Quantum Information and Computation
This is a course on the theory of quantum computing. It consists of 16 lessons, each with a video and written component, covering the basics of quantum information, quantum algorithms (including query algorithms, Shor's algorithm for integer factorization, and Grover's algorithm), the general formulation of quantum information (including density matrices, quantum channels, and general measurements), and quantum error correction (including the basics, the stabilizer formalism, CSS codes, the tor…

Quantum Executor: A Unified Interface for Quantum Computing
Giuseppe Bisicchia, Alessandro Bocci, Antonio Brogi
https://arxiv.org/abs/2507.07597 https://…

Quantum Executor: A Unified Interface for Quantum Computing
As quantum computing evolves from theoretical promise to practical deployment, the demand for robust, portable, and scalable tools for quantum software experimentation is growing. This paper introduces Quantum Executor, a backend-agnostic execution engine designed to orchestrate quantum experiments across heterogeneous platforms. Quantum Executor provides a declarative and modular interface that decouples experiment design from backend execution, enabling seamless interoperability and code reus…

Fault Tolerance by Construction
Benjamin Rodatz, Boldizs\'ar Po\'or, Aleks Kissinger
https://arxiv.org/abs/2506.17181 https://

Fault Tolerance by Construction
A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect of noise on circuits. In this work, we propose a framework for designing fault-tolerant quantum circuits that are correct by construction. The framework starts with idealised specifications of fault-tolerant gadgets and refines them using provably sound basic transformations. To reason about manipulating circuits whi…

Design Automation in Quantum Error Correction
Archisman Ghosh, Avimita Chatterjee, Swaroop Ghosh
https://arxiv.org/abs/2507.12253 https://

Design Automation in Quantum Error Correction
Quantum error correction (QEC) underpins practical fault-tolerant quantum computing (FTQC) by addressing the fragility of quantum states and mitigating decoherence-induced errors. As quantum devices scale, integrating robust QEC protocols is imperative to suppress logical error rates below threshold and ensure reliable operation, though current frameworks suffer from substantial qubit overheads and hardware inefficiencies. Design automation in the QEC flow is thus critical, enabling automated s…

Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
Daniel Litinski
https://arxiv.org/abs/2506.13619 https:/…

Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints, effectively implementing concatenated codes. However, we primarily study these protocols in the context of photonic fusion-based quantum computing (FBQC), where they yield families of fusion networks with constant-sized resourc…

Photonic processor benchmarking for variational quantum process tomography
Vladlen Galetsky, Paul Kohl, Janis N\"otzel
https://arxiv.org/abs/2507.08570

Photonic processor benchmarking for variational quantum process tomography
We present a quantum-analogous experimental demonstration of variational quantum process tomography using an optical processor. This approach leverages classical one-hot encoding and unitary decomposition to perform the variational quantum algorithm on a photonic platform. We create the first benchmark for variational quantum process tomography evaluating the performance of the quantum-analogous experiment on the optical processor against several publicly accessible quantum computing platforms,…

Relaying Quantum Information
Yigal Ilin, Uzi Pereg
https://arxiv.org/abs/2507.06770 https://arxiv.org/pdf/2507.06770

Relaying Quantum Information
Quantum relays are central to both quantum communication and distributed quantum computing, enabling long-distance transmission and modular architectures. Unlike classical repeaters, quantum repeaters preserve coherence without amplifying quantum information, relying on entanglement swapping and quantum error correction to overcome loss and decoherence. In this work, we investigate the transmission of quantum information via quantum relay channels. Our three-terminal relay model captures the tr…

A novel quantum circuit for the quantum Fourier transform
Juan M. Romero, Emiliano Montoya-Gonz\'alez, Guillermo Cruz, Roberto C. Romero
https://arxiv.org/abs/2507.08699

A novel quantum circuit for the quantum Fourier transform
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum circuit for implementing the QFT. We show that this circuit is more efficient than the conventional design. Furthermore, using this circuit, we develop an alternative version of the HHL algorithm, which also demonstrates improved performance compared to the sta…

Quantum Circuits for the Metropolis-Hastings Algorithm
Baptiste Claudon, Pablo Rodenas-Ruiz, Jean-Philip Piquemal, Pierre Monmarch\'e
https://arxiv.org/abs/2506.11576

Quantum Circuits for the Metropolis-Hastings Algorithm
Szegedy's quantization of a reversible Markov chain provides a quantum walk whose mixing time is quadratically smaller than that of the classical walk. Quantum computers are therefore expected to provide a speedup of Metropolis-Hastings (MH) simulations. Existing generic methods to implement the quantum walk require coherently computing the acceptance probabilities of the underlying Markov kernel. However, reversible computing methods require a number of qubits that scales with the complexity o…

Toward Scalable Quantum Compilation for Modular Architecture: Qubit Mapping and Reuse via Deep Reinforcement Learning
Sokea Sang, Leanghok Hour, Youngsun Han
https://arxiv.org/abs/2506.09323

Toward Scalable Quantum Compilation for Modular Architecture: Qubit Mapping and Reuse via Deep Reinforcement Learning
Modular quantum architectures have emerged as a promising approach for scaling quantum computing systems by connecting multiple Quantum Processing Units (QPUs). However, this approach introduces significant challenges due to costly inter-core operations between chips and quantum state transfers, which contribute to noise and quantum decoherence. This paper presents QARMA, a novel Qubit mapping using Attention-based deep Reinforcement learning (DRL) for Modular quantum Architectures, along with …

Hybrid satellite-fiber quantum network
Yanxuan Shao, Saikat Guha, Adilson E. Motter
https://arxiv.org/abs/2507.12539 https://arxiv.or…

Hybrid satellite-fiber quantum network
Quantum networks hold promise for key distribution, private and distributed computing, and quantum sensing, among other applications. The scale of such networks for ground users is currently limited by one's ability to distribute entanglement between distant locations. This can in principle be carried out by transmitting entangled photons through optical fibers or satellites. The former is limited by fiber optic attenuation while the latter is limited by atmospheric extinction and diffraction. …

Qymera: Simulating Quantum Circuits using RDBMS
Tim Littau, Rihan Hai
https://arxiv.org/abs/2506.08759 https://arxiv.org/pdf/2506.087…

Qymera: Simulating Quantum Circuits using RDBMS
Quantum circuit simulation is crucial for quantum computing such as validating quantum algorithms. We present Qymera, a system that repurposes relational database management systems (RDBMSs) for simulation by translating circuits into SQL queries, allowing quantum operations to run natively within an RDBMS. Qymera supports a wide range of quantum circuits, offering a graphical circuit builder and code-based interfaces to input circuits. With a benchmarking framework, Qymera facilitates comparis…

Tangent Space Excitation Ansatz for Quantum Circuits
Ji-Yao Chen, Bochen Huang, D. L. Zhou, Norbert Schuch, Chenfeng Cao, Muchun Yang
https://arxiv.org/abs/2507.07646

Tangent Space Excitation Ansatz for Quantum Circuits
Computing the excitation spectra of quantum many-body systems on noisy quantum devices is a promising avenue to demonstrate the practical utility of current quantum processors, especially as we move toward the ``megaquop'' regime. For this task, here we introduce a \textit{tangent-space excitation ansatz} for quantum circuits, motivated by the quasi-particle picture of many-body systems and the structural similarity between quantum circuits and classical tensor networks. Increasing the circuit …

Unitary Scrambling and Collapse: A Quantum Diffusion Framework for Generative Modeling
Yihua Li, Jiayi Chen, Tamanna S. Kumavat, Kyriakos Flouris
https://arxiv.org/abs/2506.10571 …

Unitary Scrambling and Collapse: A Quantum Diffusion Framework for Generative Modeling
Quantum computing, with its promise of exponential speedups, is rapidly emerging as a powerful paradigm for advancing artificial intelligence. We propose QSC-Diffusion, the first fully quantum diffusion-based framework for image generation. Our method integrates classical Gaussian noise with quantum scrambling in the forward process, and employs parameterized quantum circuits with measurement-induced collapse for reverse denoising -- enabling end-to-end sampling without reliance on classical ne…

Fast, continuous and coherent atom replacement in a neutral atom qubit array
Yiyi Li, Yicheng Bao, Michael Peper, Chenyuan Li, Jeff D. Thompson
https://arxiv.org/abs/2506.15633

Fast, continuous and coherent atom replacement in a neutral atom qubit array
Neutral atom quantum processors are a promising platform for scalable quantum computing. An obstacle to implementing deep quantum circuits is managing atom loss, which constitutes a significant fraction of all errors. Current approaches are either not capable of replacing lost atoms in the middle of a circuit -- and therefore restricted to fixed, short circuit depths -- or require more than an order of magnitude longer time than gate and measurement operations to do so. In this work, we demonst…

CleanQRL: Lightweight Single-file Implementations of Quantum Reinforcement Learning Algorithms
Georg Kruse, Rodrigo Coelho, Andreas Rosskopf, Robert Wille, Jeanette Miriam Lorenz
https://arxiv.org/abs/2507.07593

CleanQRL: Lightweight Single-file Implementations of Quantum Reinforcement Learning Algorithms
At the interception between quantum computing and machine learning, Quantum Reinforcement Learning (QRL) has emerged as a promising research field. Due to its novelty, a standardized and comprehensive collection for QRL algorithms has not yet been established. Researchers rely on numerous software stacks for classical Reinforcement Learning (RL) as well as on various quantum computing frameworks for the implementation of the quantum subroutines of their QRL algorithms. Inspired by the CleanRL l…

Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies
Maria Gabriela Jord\~ao Oliveira, Nina Glaser
https://arxiv.org/abs/2506.09971

Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies
Determining eigenvalues is a computationally expensive task that is crucial for countless applications in natural sciences. Toward this end, we introduce the quantum block Krylov subspace projector (QBKSP) algorithm, a multireference quantum variant of the Lanczos algorithm designed to accurately compute low-lying eigenvalues, including degenerate states. We present three different compact quantum circuits to evaluate the required expectation values, each suited to different problem settings. T…

Comparison of schemes for highly loss tolerant photonic fusion based quantum computing
Sara Bartolucci, Tom Bell, Hector Bombin, Patrick Birchall, Jacob Bulmer, Christopher Dawson, Terry Farrelly, Samuel Gartenstein, Mercedes Gimeno-Segovia, Daniel Litinski, Yehua Liu, Robert Knegjens, Naomi Nickerson, Andrea Olivo, Mihir Pant, Ashlesha Patil, Sam Roberts, Terry Rudolph, Chris Sparrow, David Tuckett, Andrzej Veitia

Comparison of schemes for highly loss tolerant photonic fusion based quantum computing
We summarize the performance of recently-proposed methods for achieving fault tolerant fusions-based quantum computation with high tolerance to qubit loss, specifically aimed at photonic implementations.

This https://arxiv.org/abs/2505.24765 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Supervised Quantum Machine Learning: A Future Outlook from Qubits to Enterprise Applications
Supervised Quantum Machine Learning (QML) represents an intersection of quantum computing and classical machine learning, aiming to use quantum resources to support model training and inference. This paper reviews recent developments in supervised QML, focusing on methods such as variational quantum circuits, quantum neural networks, and quantum kernel methods, along with hybrid quantum-classical workflows. We examine recent experimental studies that show partial indications of quantum advantag…

Analyzing Common Electronic Structure Theory Algorithms for Distributed Quantum Computing
Grier M. Jones, Hans-Arno Jacobsen
https://arxiv.org/abs/2507.01902

Analyzing Common Electronic Structure Theory Algorithms for Distributed Quantum Computing
To move towards the utility era of quantum computing, many corporations have posed distributed quantum computing (DQC) as a framework for scaling the current generation of devices for practical applications. One of these applications is quantum chemistry, also known as electronic structure theory, which has been poised as a "killer application" of quantum computing, To this end, we analyze five electronic structure methods, found in common packages such as Tequila and ffsim, which can be easily…

Future Impact of Quantum Computing on the Computational Landscape of Power Electronics: A Short Tutorial
Nikolaos G. Paterakis, Petros Karamanakos, Corey O'Meara, Georgios Papafotiou
https://arxiv.org/abs/2507.02577

Future Impact of Quantum Computing on the Computational Landscape of Power Electronics: A Short Tutorial
Quantum computing is emerging as a promising technology for solving complex optimization problems that arise in various engineering fields, and therefore has the potential to also significantly impact power electronics applications. This paper offers a concise tutorial on fundamental concepts in quantum computing, serving as both an introduction to the field and a bridge to its potential applications in power electronics. As a first step in this direction, the use of quantum computing for solvi…

Quantum Spectral Clustering: Comparing Parameterized and Neuromorphic Quantum Kernels
Donovan Slabbert, Dean Brand, Francesco Petruccione
https://arxiv.org/abs/2507.07018

Quantum Spectral Clustering: Comparing Parameterized and Neuromorphic Quantum Kernels
We compare a parameterized quantum kernel (pQK) with a quantum leaky integrate-and-fire (QLIF) neuromorphic computing approach that employs either the Victor-Purpura or van Rossum kernel in a spectral clustering task, as well as the classical radial basis function (RBF) kernel. Performance evaluation includes label-based classification and clustering metrics, as well as optimal number of clusters predictions for each dataset based on an elbow-like curve as is typically used in $K$-means cluster…

This https://arxiv.org/abs/2501.14380 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Verifying Fault-Tolerance of Quantum Error Correction Codes
Quantum computers have advanced rapidly in qubit count and gate fidelity. However, large-scale fault-tolerant quantum computing still relies on quantum error correction code (QECC) to suppress noise. Manually or experimentally verifying the fault-tolerance property of complex QECC implementation is impractical due to the vast error combinations. This paper formalizes the fault-tolerance of QECC implementations within the language of quantum programs. By incorporating the techniques of quantum s…

Experimental memory control in continuous variable optical quantum reservoir computing
Iris Paparelle, Johan Henaff, Jorge Garcia-Beni, Emilie Gillet, Gian Luca Giorgi, Miguel C. Soriano, Roberta Zambrini, Valentina Parigi
https://arxiv.org/abs/2506.07279

Experimental memory control in continuous variable optical quantum reservoir computing
Quantum reservoir computing (QRC) offers a promising framework for online quantum-enhanced machine learning tailored to temporal tasks, yet practical implementations with native memory capabilities remain limited. Here, we demonstrate an optical QRC platform based on deterministically generated multimode squeezed states, exploiting both spectral and temporal multiplexing in a fully continuous-variable (CV) setting, and enabling controlled fading memory. Data is encoded via programmable phase sh…

Supervised Quantum Machine Learning: A Future Outlook from Qubits to Enterprise Applications
Srikanth Thudumu, Jason Fisher, Hung Du
https://arxiv.org/abs/2505.24765

Supervised Quantum Machine Learning: A Future Outlook from Qubits to Enterprise Applications
Supervised Quantum Machine Learning (QML) represents an intersection of quantum computing and classical machine learning, aiming to use quantum resources to support model training and inference. This paper reviews recent developments in supervised QML, focusing on methods such as variational quantum circuits, quantum neural networks, and quantum kernel methods, along with hybrid quantum-classical workflows. We examine recent experimental studies that show partial indications of quantum advantag…