Q-REFINE: A Quantum Datacenter Design Optimization Framework

Abstract: Quantum datacenter (QDC) architectures must support communication among quantum processing units (QPUs) under limited communication qubits, optical switching and measurement resources, probabilistic entanglement generation, and physical-layer noise. This paper presents Q-REFINE, a framework for Quantum Resource Exploration via Factorial & Iterative N-factor Experiments. Its measure is the completion rate, the rate at which requests […]

Quantum Communication Infrastructure Cost Optimization Using a Genetic Algorithm

Abstract: This paper proposes an optimization model for the design of quantum communication infrastructures (QCI) with the aim of minimizing capital expenditure (CAPEX), focusing on the costs associated with the deployment of quantum links and trusted repeater nodes (TRNs). The model is formulated using an integer linear programming (ILP) program that incorporates physical and operational […]

Grover Adaptive Search Based Hybrid Benders Decomposition for Mixed-Integer Linear Programs

Abstract: Mixed-integer linear programs are widely used to model optimization problems involving both discrete and continuous variables, but remain computationally challenging due to the combinatorial complexity. To exploit the potential advantages of quantum computing in tackling the combinatorial optimization part, recent efforts have explored hybrid quantum-classical Benders decomposition frameworks, which delegate the discrete master problem […]

Robust Design Under Uncertainty in Quantum Error Mitigation

Abstract: Error mitigation techniques are crucial to achieving near-term quantum advantage. Classical post-processing of quantum computation outcomes is a popular approach for error mitigation, which includes methods such as Zero Noise Extrapolation, Virtual Distillation, and learning-based error mitigation. However, these techniques have limitations due to the propagation of uncertainty resulting from the finite shot number […]