Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of quantum computing

Quantum Algorithm for Appointment Scheduling

Wenbin Yu, Yinsong Xu, Wenjie Liu, Alex Xiangyang Liu, Baoyu Zheng

Published Jan 1, 2019• 1 citation
Publisher

Abstract

Suppose a practical scene that when two or more parties want to schedule an appointment, they need to share their calendars with each other in order to make it possible. According to the present result the whole communication... | Find, read and cite all the research you need on Tech Science Press
DOI
10.32604/jqc.2019.07412

Related papers

Research on Optimization of Hierarchical Quantum Circuit Scheduling Strategy

Ziao Han, Hui Li, Kai Lu +2 more

Traditional quantum circuit scheduling approaches underutilize the inherent parallelism of quantum computation in the Noisy Intermediate-Scale Quantum (NISQ) era, overlook the inter-layer operations can be further parallelize... | Find, read and cite all the research you need on Tech Science Press

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2025•1 citation

A Novel Scheduling Framework for Multi-Programming Quantum Computing in Cloud Environment

Danyang Zheng, Jinchen Xv, Feng Yue +3 more

As cloud quantum computing gains broader acceptance, a growing quantity of researchers are directing their focus towards this domain. Nevertheless, the rapid surge in demand for cloud-based quantum computing resources has led... | Find, read and cite all the research you need on Tech Science Press

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2024•5 citations

Practical quantum appointment scheduling

Dave Touchette, Benjamin Lovitz, Norbert Lütkenhaus

A quantum appointment-scheduling protocol based on coherent states and basic linear optics operations is proposed. The protocol is shown to perform better than a classical one in terms of information leakage.

arXiv:1801.02771•Physical Review A•Apr 12, 2018•6 citations

Quantum Communication Networks and Trust Management: A Survey

Shibin Zhang, Yan Chang, Lili Yan +5 more

This paper summarizes the state of art in quantum communication networks and trust management in recent years. As in the classical networks, trust management is the premise and foundation of quantum secure communication and c... | Find, read and cite all the research you need on Tech Science Press

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2019•17 citations

Entanglement and swap of quantum states in two qubits

IkutoTakaya, IshizakaSatoshi

Suppose that two distant parties Alice and Bob share an entangled state ρAB, and they want to exchange the subsystems of ρAB by local operations and classical communication (LOCC). In general, this...

Quantum Information and Computation•Sep 1, 2015•0 citations

Quantum algorithms for scheduling problems: a survey

Tino Werner, Freyja Ullinger

Abstract Quantum algorithms have the potential to solve combinatorial optimization problems faster than classical algorithms. A particular example for combinatorial optimization problems are scheduling problems. This work provides summarizes quantum or quantum-inspired algorithms for scheduling problems, providing an overview of 20 years of research. We categorize the approaches by problem type and algorithm type. A condensation of the reviewed literature to the main ideas and details about the considered problem size, solvers and evaluation metrics enables a quick comparison with and placement into the current state of research for future works. We further critically assess the comparability of the reviewed literature and present crucial metrics for future comparison.

EPJ Quantum Technology•Mar 19, 2026•0 citations
Abstract Quantum algorithms have the potential to solve combinatorial optimization problems faster than classical algorithms. A particular example for combinatorial optimization problems are scheduling problems. This work provides summarizes quantum or quantum-inspired algorithms for scheduling problems, providing an overview of 20 years of research. We categorize the approaches by problem type and algorithm type. A condensation of the reviewed literature to the main ideas and details about the considered problem size, solvers and evaluation metrics enables a quick comparison with and placement into the current state of research for future works. We further critically assess the comparability of the reviewed literature and present crucial metrics for future comparison.