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

Texts in computer science

Concise Guide to Quantum Computing: Algorithms, Exercises, and Implementations

Sergei Kurgalin, Sergei Borzunov

Published Jan 1, 2021• 17 citations
Publisher
DOI
10.1007/978-3-030-65052-0

Related papers

Concise Guide to Quantum Machine Learning

Davide Pastorello

Machine learning•Dec 16, 2022•20 citations

An Introduction to Quantum Computing for Computer Engineers

Marcus Stephen Edwards

Springer eBooks•Jan 1, 2026•0 citations

Practical Guide to Quantum Computing – Variational Algorithms (Based on Materials from IBM Q) # 1

Mikhail Pavlov

Abstract This practical guide presents hands-on laboratory exercises on variational quantum algorithms (VQAs) and hybrid quantum-classical workflows, based on the IBM Q learning platform. The work was performed by the author on April 28, 2024, using IBM Q cloud resources. Variational algorithms leverage the variational principle of quantum mechanics to optimize quantum circuits for specific tasks, making them particularly suitable for current noisy intermediate-scale quantum (NISQ) devices and offering a practical route toward achieving quantum advantage. The guide explores the full workflow for designing and implementing variational algorithms, highlighting the trade-offs inherent at each stage, including circuit design, parameter initialization, optimization strategies, and measurement post-processing. It also demonstrates the use of Qiskit Runtime primitives to enhance both the speed and accuracy of computations. Through these exercises, participants gain experience in constructing hybrid quantum-classical algorithms, performing parameter optimization, and interpreting results within the context of near-term quantum devices. While this guide focuses on practical implementation, it also encourages exploration of the underlying theoretical foundations of quantum information and computation, connecting applied algorithmic practice with fundamental principles. The course and exercises provide a structured starting point for researchers, developers, and students aiming to explore the utility of quantum computers for real-world problem solving, particularly in optimization, quantum chemistry, and machine learning applications.

•Mar 3, 2026•0 citations

A Student’s Guide to Quantum Computing

Stefano Olivares

Lecture notes in physics•Jan 1, 2025•2 citations

Practical Guide to Quantum Computing – Variational Algorithms: Cost Functions (Based on Materials from IBM Q) # 4

Mikhail Pavlov

Abstract This practical guide focuses on the evaluation and implementation of cost functions in variational quantum algorithms (VQAs), based on IBM Q learning resources. The exercises were performed by the author on May 2, 2024, using IBM Q cloud resources. Cost functions are central to variational algorithms, defining the objective that the optimizer seeks to minimize or maximize, and linking the parameterized quantum state to the computational task. In this lesson, participants first learn to utilize Qiskit Runtime primitives to implement efficient and accurate evaluation routines. The cost function C(θ⃗)C(\vec{\theta})C(θ) is defined according to the specific problem, encoding the target metric that guides the variational optimization. The guide also introduces strategies for measurement selection and execution to optimize computational speed and reduce statistical errors during evaluation, leveraging cloud-based quantum resources. Hands-on exercises in Qiskit provide experience in constructing cost function evaluations, applying them to parameterized ansätze, and integrating them with classical optimization routines. Participants explore the trade-offs between measurement overhead, convergence speed, and accuracy, reinforcing the understanding of how cost functions drive the performance of hybrid quantum-classical algorithms on noisy intermediate-scale quantum (NISQ) devices. This lesson equips participants with practical skills in defining, implementing, and measuring cost functions, forming the foundation for efficient variational algorithm design in quantum chemistry, optimization, and machine learning applications.

•Mar 4, 2026•0 citations

Introduction to Quantum Computer : Basics and Recent Advances(Tutorials)

Shiro Kawabata

電子情報通信学会誌•Sep 1, 2005•0 citations
Abstract This practical guide presents hands-on laboratory exercises on variational quantum algorithms (VQAs) and hybrid quantum-classical workflows, based on the IBM Q learning platform. The work was performed by the author on April 28, 2024, using IBM Q cloud resources. Variational algorithms leverage the variational principle of quantum mechanics to optimize quantum circuits for specific tasks, making them particularly suitable for current noisy intermediate-scale quantum (NISQ) devices and offering a practical route toward achieving quantum advantage. The guide explores the full workflow for designing and implementing variational algorithms, highlighting the trade-offs inherent at each stage, including circuit design, parameter initialization, optimization strategies, and measurement post-processing. It also demonstrates the use of Qiskit Runtime primitives to enhance both the speed and accuracy of computations. Through these exercises, participants gain experience in constructing hybrid quantum-classical algorithms, performing parameter optimization, and interpreting results within the context of near-term quantum devices. While this guide focuses on practical implementation, it also encourages exploration of the underlying theoretical foundations of quantum information and computation, connecting applied algorithmic practice with fundamental principles. The course and exercises provide a structured starting point for researchers, developers, and students aiming to explore the utility of quantum computers for real-world problem solving, particularly in optimization, quantum chemistry, and machine learning applications.
Abstract This practical guide focuses on the evaluation and implementation of cost functions in variational quantum algorithms (VQAs), based on IBM Q learning resources. The exercises were performed by the author on May 2, 2024, using IBM Q cloud resources. Cost functions are central to variational algorithms, defining the objective that the optimizer seeks to minimize or maximize, and linking the parameterized quantum state to the computational task. In this lesson, participants first learn to utilize Qiskit Runtime primitives to implement efficient and accurate evaluation routines. The cost function C(θ⃗)C(\vec{\theta})C(θ) is defined according to the specific problem, encoding the target metric that guides the variational optimization. The guide also introduces strategies for measurement selection and execution to optimize computational speed and reduce statistical errors during evaluation, leveraging cloud-based quantum resources. Hands-on exercises in Qiskit provide experience in constructing cost function evaluations, applying them to parameterized ansätze, and integrating them with classical optimization routines. Participants explore the trade-offs between measurement overhead, convergence speed, and accuracy, reinforcing the understanding of how cost functions drive the performance of hybrid quantum-classical algorithms on noisy intermediate-scale quantum (NISQ) devices. This lesson equips participants with practical skills in defining, implementing, and measuring cost functions, forming the foundation for efficient variational algorithm design in quantum chemistry, optimization, and machine learning applications.