Abstract: Optimal routing in quantum-repeater networks requires finding the best path that connects a pair of end nodes. Most previous work on routing in quantum networks assumes utility functions that are isotonic, meaning that the ordering of two paths does not change when extending both with the same edge. However, we show that utility functions […]
Abstract: Scalable quantum networks require quantum repeaters to overcome major challenges such as photon loss and decoherence in long-distance quantum communication. In this paper, we present a cavity-magnon quantum repeater architecture that exploits the frequency tunability and hybrid integration capabilities of magnonic platforms to enable efficient entanglement swapping across multi-hop networks. The coherence budget is […]
Abstract: Network optimization problems represent large combinatorial search spaces that grow exponentially with network size, making them computationally intensive to solve. This paper addresses the latency-resilient Layer 3 routing optimization problem in telecommunications networks with predefined Layer 1 optical links. We formulate this problem as a graph-based optimization problem with the objective of minimizing latency, […]
Abstract: The Al/AlOx/Al system is widely used for the fabrication of Josephson junctions, which constitute the central element of superconducting qubits. The process parameters for growing ultra-thin AlOx barriers by thermal oxidation in-between physical vapor deposition (PVD) runs of Al films are well understood, but the resulting barriers present several drawbacks that limit performance such […]
Abstract: Circuit compression is a key requirement for near-term quantum computing, yet the factors that govern stability under gate removal are not fully understood. We study this problem via a large-scale numerical analysis of 300 structurally uniform circuits across 10, 12, and 14 qubits. Despite identical macroscopic resources, each ensemble separates into two stability classes […]
Abstract: This paper presents a comprehensive survey of the current frontier in quantum computing for computational sciences, evaluating the technical requirements to translate theoretical asymptotic speedups into practical utility in the areas of chemistry, biochemistry, and materials science. We review foundational algorithms, including the Quantum Fourier Transform (QFT), Quantum Phase Estimation (QPE), and the quantum […]
Abstract: Engineering quantum circuits that use minimal resource requirements is essential for suppressing noise-induced errors and enhancing the performance of quantum processors. Here, we propose minimal-complexity hardware constructions of Clifford circuits for implementing new two-qubit Clifford gates, effectively expanding the available Clifford circuit library. The circuits are realized through engineered coherent phonon-mediated interactions between two […]
Abstract: Hole spin qubits in silicon nanostructures offer fast, all-electrical control through electric-dipole spin resonance (EDSR), yet their performance strongly depends on device geometry. In this work, optimization criteria of Rabi frequency of single-hole spin qubits in silicon-on-insulator (SOI) quantum dots are identified by combining electrostatic and kk⋅pp simulations with a perturbative model of the […]
Abstract: We propose a novel design of Ge1-xSnx-on-Si single-photon avalanche photodiodes (SPADs) that aim to enhance the fill factor (FF) and minimize noise at room temperature. The device consists of a n+/i-well dot structure designed to eliminate the need for guard rings and multi-dot or array configurations typically used to enhance the active area. This […]
Abstract: The scalability of neutral-atom quantum computing is increasingly limited by a compiler–architecture challenge: logical circuits must be mapped onto dynamically reconfigurable atom arrays while controlling crosstalk, transport overhead, and hardware constraints. To address this problem, we present ZAP, a co-designed zoned architecture and deterministic compiler for field-programmable atom arrays. ZAP partitions the array into […]