Home » Tutorials Abstracts
Tutorials Abstracts
Sunday, Aug 31, 2025 — Tutorials Abstracts
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Summary — This tutorial offers a foundational introduction to quantum computing, tailored for participants with little or no prior experience. Attendees will gain practical insight into quantum models, algorithms, and hardware, preparing them to understand and eventually engage with emerging quantum technologies poised to reshape the future of computing.
Abstract — Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Relatively recently, quantum computing has advanced from a theoretical possibility to an engineered reality, with commercial entities offering early prototype quantum processors, including both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that the ubiquity of quantum computing is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that underpin quantum computing’s immense computational power. We examine the thought processes that programmers need to map problems to various quantum-computing paradigms. We also discuss the hardware and algorithmic challenges that must be overcome before quantum computing becomes a standard component of every software developer’s repertoire.
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Summary — This tutorial aims to ease participants’ journey into the joint quantum and high-performance computing field—an exciting area of research that may well hold the key to performant quantum computing. We recommend that any interested quantum or HPC practitioners attend an introduction to QHPC, where they can gain insight into our work, including code implementations and encourage active audience participation.
Abstract — Supercomputers and quantum computers both aim to revolutionize the computing world by tackling challenges well beyond the reach of previous processing power. These technologies have, for the most part, been evolving in separate ways, but is this the best approach? We argue that the combination of quantum computing and HPC (QHPC) is not only possible, but also inevitable. In this tutorial, we delve into the challenges we have faced while creating hybrid quantum-classical pipelines. By raising these challenges, we aim to educate and inform HPC and quantum engineers about the integration pitfalls and best practices for overcoming them, thereby making the QHPC field more accessible. We will explore the need and challenges associated with building pipelines that require low-latency communication between QPUs and CPUs. This will involve exploring use cases that require such closely coupled architectures, the different ways these architectures can be built, and the development of an example workflow that takes advantage of fast information exchange between QPUs and CPUs. We will then examine how to best leverage HPC to mitigate QPU overhead. This will include an in-depth examination of an algorithm that dynamically switches between simulation and hardware runs to approximate varying problem sizes during training. These are open-ended questions, and we will explore the different approaches behind them before focusing on our own experiences. This will be done through open dialogue, interactive polls and Jupyter notebook coding implementations. We hope attendees will come away feeling equipped to embark on their journey into QHPC.
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Summary — Attendees will learn techniques for program generation on NISQ and early fault-tolerant devices. These techniques rely on program synthesis and are implemented in the BQSKit framework: dynamic circuit generation, approximation generation, and FT synthesis using diagonalization. The target audience spans hardware, compiler, and algorithm designers.
Abstract — This tutorial will introduce several techniques intrinsic to program generation for early fault-tolerant and FT devices. The target audience is broad: hardware designers, compiler writers and algorithm designers can all benefit. Code generation is performed through synthesis using the Berkeley Quantum Synthesis Toolkit (BQSKit). The techniques we introduce are novel, practical, and currently only supported in BQSKit. First, we will demonstrate how to utilize synthesis for generating circuits using mid-circuit measurement (MCM) and feed-forward operation to prepare an arbitrary state or implement an arbitrary unitary. With this technique, one can optimize circuit resources. Second, we will show how to build robust circuit approximations using ensembles. Approximations manipulate “error” and can be applied at the NISQ or FT level, serving as a resource optimization and error mitigation technique. Furthermore, all feasible methods for generating FT circuits are approximate. Third, we will introduce synthesis methods for FT devices, targeting RZ reduction and the Clifford+T gate set. The methods use matrix diagonalization rather than inversion and constrained optimization, and we will show how to extend them with other magic states (e.g., √ T, V).
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Summary — In this tutorial, attendees will learn how to use the open-source Quantum Instrumentation Control Kit (QICK) system to control qubits. Examples of QICK applications will be presented, and the QICK hardware, firmware, and software stack will be explained through live demonstrations using QICK boards.
Abstract — QICK is an open-source qubit controller that is used by hundreds of users worldwide in academia and industry. In this tutorial, we aim to engage those interested in quantum controls at any level of the stack and introduce them to the QICK hardware, firmware, and software, all of which are publicly available on GitHub. No familiarity with QICK is assumed. The core topic will be an exploration of QICK’s capabilities for quantum control using RF pulse synthesis, pulse sequencing, and readout; other QICK features, such as photon timing, will also be demonstrated. Much of the tutorial will consist of live demonstrations, giving attendees a firsthand understanding of how QICK works. Current and prospective QICK users, experts in control electronics, and those interested in the open-source quantum ecosystem will find this tutorial of interest.
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Abstract — This revised, 3rd edition of the tutorial will introduce the audience to the emerging field of secure quantum computing, which focuses on research on how to make quantum computing systems secure from attacks. By design, this tutorial will not cover post-quantum cryptography as that is an essential but orthogonal topic. The tutorial focuses on the security of quantum computing systems, as rapid advances in quantum computer technologies hold the promise of enabling quantum computers to run algorithms for generating novel drugs or material compounds. Once quantum computers are generating or processing sensitive data or valuable intellectual property, they will become a target for attacks that aim to disrupt their operation, modify computations, or even attempt to steal data or quantum circuit code. Moreover, many quantum computers are already cloud-based, and with remote, on-demand cloud access, they make them vulnerable to remote security attacks, no different from those in today’s classical cloud computing. First, this tutorial will introduce the audience to classical computer security concepts, including threat modelling, confidentiality, integrity, and availability, as well as information leaks, side-channel and covert-channel attacks. Second, this tutorial will demonstrate examples of security attacks prototyped on real cloud-based NISQ quantum computers available today, as well as prototype attacks of FTQC quantum computers. Third, the tutorial will present designs for securing the cloud-based NISQ and FTQC quantum computers. Lastly, the tutorial will present challenges and opportunities to build quantum computer security from the ground up, rather than patch them later once security attacks have occurred in the wild.
B. What will the target audience learn? Quantum computing engineers and researchers will learn how to design more secure quantum computers and protect computing machines from vulnerabilities, as many quantum computers are now connected to the internet (e.g., IBM Quantum, Amazon Braket, Microsoft Azure).
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Summary — This tutorial introduces SeQUeNCe, an open-source simulator for modeling quantum networks. It covers quantum communication fundamentals, SeQUeNCe’s architecture, and includes hands-on exercises, along with a live demo. Advanced topics, such as parallel execution for large-scale simulations, will also be explored. The session is beginner-friendly and relevant to researchers and infrastructure providers in the field of quantum networking.
Abstract — Quantum networks promise to deliver new, revolutionary applications that include distributing cryptographic keys with provable security, synchronizing clocks with unprecedented accuracy, and distributed quantum computing. Recent breakthroughs in quantum engineering have enabled the experimental realization of quantum network prototypes. One of the most significant engineering challenges is building networks that scale both in terms of the number of users and the communication distance. Achieving this goal requires a combination of advances in hardware, standardization of network architectures, development of robust control plane protocols, and techniques that allow reproducible performance testing. Quantum network simulations can help in understanding the tradeoffs of alternative quantum network architectures, optimizing quantum hardware, and developing a robust control plane. Simulator of QUantum Network Communication (SeQUeNCe) is a customizable discrete-event quantum network simulator that models quantum hardware and network protocols. SeQUeNCe employs a modularized design that separates functionality across different network layers into distinct modules. This modularized design enables the testing of alternative quantum network protocols and hardware models, as well as the study of their interactions. In this tutorial, we will start with a brief overview of quantum communications, their potential benefits, use cases, and challenges. Then, we will introduce SeQUeNCe and present its design, interface, capabilities, and limitations. We will discuss recent publications that have utilized SeQUeNCe and how it distinguishes itself from other available quantum network simulators. We will show a live demo of SeQUeNCe followed by hands-on exercises. We will then present some advanced capabilities, including the ability to parallelize the execution of large-scale quantum network simulations on high-performance computers.
• Undergrad and graduate students who want to learn and enter the field of quantum networks. They will learn how to use SeQUeNCe in their quantum network course projects. Prerequisite: minor knowledge of quantum networks and simulation software.
• Scientists and faculty who work on quantum networking devices, quantum communication protocols, and distributed quantum computing. They will learn how to use SeQUeNCe in their research projects and proposals. Prerequisite: good knowledge of quantum networks and simulation software.
• Infrastructure providers interested in building quantum networks. Prerequisite: some knowledge of quantum networks and simulation software.
TUT12 — Automated Topological Quantum Error Correction Using 3D Primitives
Purva Thakre, Southern Illinois University
Kabir Dubey, Northwestern University
Adrien Suau, QraftWare
Yiming Zhang, University of Science and Technology of China
Austin Fowler, Google Quantum AI
An Li, Pacific Northwest National Laboratory
Samuel Stein, Pacific Northwest National Laboratory
Ying Mao, Fordham University
- Date — Sun, Aug 31, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Summary — In this tutorial, participants will use TQEC’s design-automation tool to build and simulate fault-tolerant quantum circuits based on surface codes and lattice surgery with only 3D blocks. A theoretical overview will explain the fundamentals of error correction for the surface code, followed by hands-on programming exercises to design logical circuits and simulate logical error rates.
Abstract — Quantum computers require fault tolerance to achieve reliable, large-scale performance. While many architectures for topological quantum error correction have been proposed, implementing non-trivial quantum operations remains challenging due to the complexity of specifying software instructions. As a result, resource estimates and error suppression rates are often insufficiently tested. In this tutorial, we present an automated method for representing and compiling design hypotheses for surface code-protected quantum operations using TQEC, an open-source and flexible Python tool. TQEC models logical operations using three-dimensional spacetime blocks, compiling them into Stim circuit instances that can be simulated or prepared for hardware implementation. These simulations generate plots that link logical error rates to parameters, including code distance and physical error rates, providing a practical way to evaluate circuit performance and validate error suppression. When multiple fault-tolerant implementations are possible, TQEC enables direct performance comparisons through simulation-based feedback. The tutorial begins with a conceptual overview of surface code quantum computation, designed to help attendees with no prior background understand the fundamentals. The hands-on portion will guide participants through the iterative process of building fault-tolerant quantum circuits from surface code memory experiments to complete quantum algorithm constructions using TQEC for simulation and visualization. We will also outline the future roadmap for TQEC, encouraging attendees to explore further and contribute to its development.
• The tutorial is suitable for both newcomers looking to build foundational knowledge and experienced developers aiming to explore automated design and simulation workflows for large-scale fault-tolerant quantum computations.
Monday, Sep 1, 2025 — Tutorials Abstracts
- Date — Mon, Sep 1, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Mon, Sep 1, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Mon, Sep 1, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Mon, Sep 1, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Summary — This tutorial will provide an overview of quantum repeaters and networks, the NetSquid simulation package, and experience in simulating quantum repeater chains under a variety of different scenarios. Memory-based and all-photonic quantum repeaters are in scope.
Abstract — Quantum networks are envisioned to achieve novel capabilities that are provably impossible using classical networks. These novel capabilities range from cryptography, sensing and metrology to distributed systems. As with classical networks, quantum networks must be large enough to facilitate a practical level of communication, information sharing, or collaboration. Scaling quantum networks to longer distances requires advanced quantum repeater (QR) technologies. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into two categories: “memory-based” and “all-photonic” QRs. Each type of QR may be best suited for a specific type of underlying quantum technology, for a particular scale of quantum network, and for a specific regime of operational parameters. NetSquid is a software package used for the modeling and simulation of scalable quantum networks developed at QuTech. Modeling and simulation of quantum repeaters and networks using NetSquid can help in understanding the relative performance and resource requirements of different types of QRs, tradeoffs of alternative quantum network architectures, optimizing quantum hardware, and developing a robust control plane. In this tutorial, we will start with a brief overview of quantum repeaters and networks, their potential benefits and challenges. Then, we will introduce NetSquid and present its design and features. Finally, we will demonstrate how to use a quantum repeater toolkit based on NetSquid to model and simulate “all-photonic” quantum repeaters and networks, and “memory-based” trapped ion quantum repeaters and networks. We will also compare the relative performance and resource requirements of these two different types of QRs and networks.
Tuesday, Sep 2, 2025 — Tutorials Abstracts
- Date — Tue, Sep 2, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Tue, Sep 2, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Tue, Sep 2, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Tue, Sep 2, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Tue, Sep 2, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Tue, Sep 2, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Wednesday, Sep 3, 2025 — Tutorials Abstracts
- Date — Wed, Sep 3, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Wed, Sep 3, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Wed, Sep 3, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
1) Industry professionals pursuing an off-the-shelf nonlinear optimization solver to tackle problems in electrical engineering and computer science (e.g., power engineering, networking, computer vision, and signal processing).
2) Research scientists interested in state-of-art research on quantum optimization for engineering problems.
3) Quantum computing experts interested in softwarehardware co-design for practical applications.
4) Undergraduate and graduate students interested in learning quantum optimization algorithm, software, and applications.
We will begin with a gentle introduction to quantum computing and quantum technology, focusing on quantum algorithms for optimization and their implementation on quantum computing hardware. The lack of automated tools for deploying quantum applications has motivated our development of QHDOPT, an open-source software that provides a unified optimization model and is compatible with various mainstream quantum computing platforms. This tutorial will also help quantum hardware providers better envision the possible form of automated software that leverages quantum computers to solve practical problems.
- Date — Wed, Sep 3, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Wed, Sep 3, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Thursday, Sep 4, 2025 — Tutorials Abstracts
- Date — Thu, Sep 4, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Thu, Sep 4, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Thu, Sep 4, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Thu, Sep 4, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Thu, Sep 4, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
Friday, Sep 5, 2025 — Tutorials Abstracts
- Date — Fri, Sep 5, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Fri, Sep 5, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Fri, Sep 5, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30
- Date — Fri, Sep 5, 2025
- Time — 10:00 – 16:30 Mountain Time (MDT) — UTC-6
- Duration — Each tutorial is 3 hours long (2 sessions of 1.5 hours)
- Fixed time slots — 10:00 – 11:30 & 13:00 – 14:30 or 13:00 – 14:30 & 15:00 – 16:30