Demonstration of a compatibility-based childcare support service using quantum annealing

Read full text
Authors: Yu Matsumoto, Taisei Takabayashi, Rima Sato, R. Honda, Masayuki Ohzeki
Cited by: 0
References: 31

Abstract

In contemporary Japan, isolated parenting has become a serious social issue, increasing psychological stress on parents and potentially affecting children's development. Existing childcare support services tend to focus on physical assistance, while psychological support and community connections remain insufficient. To address this gap, we developed a service that connects parents with senior community members who have parenting experience, aiming to provide psychological support and foster intergenerational exchange. Achieving high-quality matching requires considering pair compatibility, balancing supporter workload, and handling scheduling constraints, which can be formulated as a combinatorial optimization problem. We represented this matching problem as a Quadratic Unconstrained Binary Optimization (QUBO) model and evaluated a quantum-annealing-based sampling pipeline against simulated annealing (SA) and the exact mixed-integer optimization solver Gurobi. In randomized benchmark instances, the QA-based pipeline generated high-quality and diverse matching candidates, particularly for larger instances; at [Formula: see text], the mean best relative error was 1.94% for QA with post-processing and 7.45% for SA. Furthermore, a proof-of-concept field experiment conducted in Sendai City, Japan, demonstrated that the framework can generate multiple high-quality matching candidates, enabling flexible scheduling in real-world operations.

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Scheduling and Timetabling Solutions Constraint Satisfaction and Optimization

Publication details

Journal / source
Scientific Reports
Publisher
Springer Science and Business Media LLC
Volume
16
Issue
1
Publication date
21 July 2026
Language
EN