Xiuqi Cao

dblp:322/6358 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0002-5149-9871ORCID · reported

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

Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Quantum computing and quantum information · 91% Graph algorithms and graph theory · 9%
Computer graphics and multimedia
1 paper
Image and video coding · 39% Multimedia systems and quality of experience · 30% Virtual and augmented reality · 30%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › compiler optimization
quantum compiler optimization
0.912025
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation · Proc. ACM Program. Lang. 2025
Quantum computing and quantum information › quantum simulation
hamiltonian simulation
0.912025
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation · Proc. ACM Program. Lang. 2025
Quantum computing and quantum information
quantum circuit compilation
0.912025
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation · Proc. ACM Program. Lang. 2025
Quantum computing and quantum information
quantum simulation
0.912025
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation · Proc. ACM Program. Lang. 2025
Multimedia systems and quality of experience › multimedia delivery
3d content delivery
0.612022
Adaptive compression of 3D models for mobile web apps · MobiSys 2022
Image and video coding › point cloud compression
geometry compression
0.612022
Adaptive compression of 3D models for mobile web apps · MobiSys 2022
Graph algorithms and graph theory › graph algorithms › network flow
minimum-cost flow
0.312025
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation · Proc. ACM Program. Lang. 2025
Image and video coding › adaptive coding
adaptive compression
0.212022
Adaptive compression of 3D models for mobile web apps · MobiSys 2022

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

minimum-cost flow · 1.7markov chain · 1.7hamiltonian term transition graph · 1.7
YearPublicationVenuePosition
2025 MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation
abstract
Quantum Hamiltonian simulation, fundamental in quantum algorithm design, extends far beyond its foundational roots, powering diverse quantum computing applications. However, optimizing the compilation of quantum Hamiltonian simulation poses significant challenges. Existing approaches fall short in reconciling deterministic and randomized compilation, lack appropriate intermediate representations, and struggle to guarantee correctness. Addressing these challenges, we present MarQSim, a novel compilation framework. MarQSim leverages a Markov chain-based approach, encapsulated in the Hamiltonian Term Transition Graph, adeptly reconciling deterministic and randomized compilation benefits. Furthermore, we formulate a Minimum-Cost Flow model that can tune transition matrices to enforce correctness while accommodating various optimization objectives. Experimental results demonstrate MarQSim’s superiority in generating more efficient quantum circuits for simulating various quantum Hamiltonians while maintaining precision.
Xiuqi Cao, Junyu Zhou 0005, Yuhao Liu 0017, Yunong Shi, Gushu Li
Proc. ACM Program. Lang.1
2022 Adaptive compression of 3D models for mobile web apps
abstract
The rise of metaverse has driven the burst of 3D Web apps to provide immersive experience across heterogeneous devices. However, loading 3D models in Web apps is usually slow especially on mobile devices with limited computation capability and dynamic network condition, harming the experience of 3D mobile Web apps. In this paper, we propose an approach called 3Dispatcher to reducing the 3D model loading time by adaptively compressing the 3D models. Preliminary results show that 3Dispatcher can speed up the 3D model load by 15%-41% in different scenarios.
Xinran Dong, Xiuqi Cao, Yun Ma 0002
MobiSys3