Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Quoc-Bao Tran

dblp:395/8080 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Artificial intelligence
1 paper
Graph learning · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.912025
Scalable Quantum-Inspired Optimization Through Dynamic Qubit Compression · AAAI 2025
Emerging computing paradigms › quantum computing
quantum annealing
0.912025
Scalable Quantum-Inspired Optimization Through Dynamic Qubit Compression · AAAI 2025
Emerging computing paradigms
quantum computing
0.912025
Scalable Quantum-Inspired Optimization Through Dynamic Qubit Compression · AAAI 2025
Mathematical optimization
combinatorial optimization
0.912025
Scalable Quantum-Inspired Optimization Through Dynamic Qubit Compression · AAAI 2025

Methods — techniques the papers use, named apart from their topics

qubit compression · 2.6graph neural network · 2.6
YearPublicationVenuePosition
2025 Scalable Quantum-Inspired Optimization Through Dynamic Qubit Compression
abstract
Hard combinatorial optimization problems, often mapped to Ising models, promise potential solutions with quantum advantage but are constrained by limited qubit counts in near-term devices. We present an innovative quantum-inspired framework that dynamically compresses large Ising models to fit available quantum hardware of different sizes. Thus, we aim to bridge the gap between large-scale optimization and current hardware capabilities. Our method leverages a physics-inspired GNN architecture to capture complex interactions in Ising models and accurately predict alignments among neighboring spins (aka qubits) at ground states. By progressively merging such aligned spins, we can reduce the model size while preserving the underlying optimization structure. It also provides a natural trade-off between the solution quality and size reduction, meeting different hardware constraints of quantum computing devices. Extensive numerical studies on Ising instances of diverse topologies show that our method can reduce instance size at multiple levels with virtually no losses in solution quality on the latest D-wave quantum annealers.
Co Tran, Quoc-Bao Tran, Truong Son Hy, Thang N. Dinh
AAAI2