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

arXiv:2610.01099

Constant-Per-Layer-Depth MPS-Pretrained Ansatz for Noisy Distributed Quantum Processors

Seongpyo Hong, Woodo Lee, Yong-Su Kim, Seung-Sup B. Lee, Junghyun Lee

quant-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations• Revised Oct 30, 2026 (v2)
v1 · Oct 1, 2026v2 · Oct 30, 2026
arXivHTMLPDF

Abstract

Distributed quantum processors could scale variational algorithms beyond single devices, but circuit depth, communication overhead, and noise limit their performance. We compare ladder, mixed-canonical, and brick-wall realizations of matrix-product-state (MPS) pretraining with matched per-layer two-qubit-block resources. Despite comparable ideal variational quantum eigensolver performance and gradient scales, the shallower brick-wall architecture reduces circuit duration, idle-time decoherence, and zero-noise-extrapolation (ZNE) overhead, yielding superior noisy and ZNE-assisted performance. We then extend MPS-pretrained circuits to modular processors with one communication qubit per quantum processing unit (QPU); a nearest-neighbor QPU-path schedule keeps the per-layer depth constant as QPUs are added. Distributed circuits whose inter-QPU links realize long-range interactions of the target Hamiltonian match or outperform the single-processor brick-wall under noise when communication idle time is short compared with the coherence time. These results establish hardware-aware co-design of tensor-network pretraining, circuit scheduling, and communication topology as a principle for variational quantum computation on noisy modular hardware.

AI Summary

The paper asks how circuit layout and communication scheduling affect MPS-pretrained VQE under finite-duration noise. It compares ladder, mixed-canonical, and brick-wall circuits with $N-1$ two-qubit blocks per layer, then extends brick-wall circuits to modular processors with one communication qubit per QPU. Evidence comes from noiseless and density-matrix simulations with gate-local Pauli errors, thermal relaxation during gates and idling, and folding-based zero-noise extrapolation (ZNE). The single-processor layouts have nominal per-layer block depths $N-1$, $\lceil N/2\rceil$, and $2$, respectively, and comparable ideal VQE performance and sampled gradient scales in the tested regimes. For eight qubits and four layers, brick-wall gives mean unmitigated relative energy error $0.159$, versus approximately $0.18$ for the other layouts. Its noiseless error after ZNE-assisted training is $0.0018$, versus $0.0027$–$0.0034$. Controls attribute the noise advantage primarily to reduced idle-time decoherence. A nearest-neighbor QPU-path schedule requires two communication rounds per layer, independent of QPU count; all-to-all communication requires linearly growing depth. Nine-qubit, two-/three-QPU simulations show connectivity–communication trade-offs: selected Hamiltonian-matched links outperform single-QPU brick-wall only in favorable communication regimes. With short gates and ZNE-assisted training, some advantages persist for inter-QPU gates ten times slower and noisier than local gates. Limitations include phenomenological noise, exact expectations without shot noise, only eight-/nine-qubit noisy benchmarks, and at most three simulated QPUs. The principal Hamiltonian is a permuted Heisenberg chain; reordering removes the connectivity advantage. Pretraining mainly accelerates initial distributed optimization, and extrapolated energies can improve without improving the underlying noiseless state.

Little sign of AI-generated textAI use disclosedIncrementalSmall numerics onlyStrong assumptions
Large language model tools were used to assist with language editing, manuscript consistency checks, and preparation of data and code availability materials.

Error found: The abstract's distributed-performance claim omits that its successful comparisons fix a disadvantageous qubit ordering, while reordering the same Hamiltonian lets the single-QPU brick-wall outperform every tested fixed-order circuit without mitigation. The abstract overgeneralizes the conditions for distributed improvement: short communication idle times and links matching Hamiltonian interactions are not sufficient in the reported tests without favorable link selection and gate-error costs.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
24 pages, 8 figures; Supplementary Information (22 pages) appended

Related papers

Scalable Preparation of Matrix Product States with Sequential and Brick Wall Quantum Circuits

Tomasz Szołdra, Rick Mukherjee, Peter Schmelcher

Preparing arbitrary quantum states requires exponential resources. Matrix Product States (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly rely on heuristic circuits that are deterministic but quickly saturate in accuracy, or on variational optimization methods that reach high fidelities but scale poorly. This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline. Heuristic staircase-like and brick wall disentangler circuits provide warm-start initializations for variational optimization, enabling high-fidelity state preparation for large systems. Target MPSs are either specified as physical quantum states or constructed from classical datasets via amplitude encoding, using step-by-step singular value decompositions or tensor cross interpolation. The framework incorporates entanglement-based qubit reordering, reformulated as a quadratic assignment problem, and low-level optimizations that reduce depths by up to 50% and CNOT counts by 33%. We evaluate the full pipeline on datasets of varying complexity across systems of 19-50 qubits and identify trade-offs between fidelity, gate count, and circuit depth. Optimized brick wall circuits typically achieve the lowest depths, while the optimized staircase-like circuits minimize gate counts. Overall, our results provide principled and scalable protocols for preparing MPSs as quantum circuits, supporting utility-scale applications on near-term quantum devices.

quant-pharXiv:2602.12042•Quantum Science and Technology•Feb 13, 2026•7 citations

Distributed Quantum Error Mitigation: Global and Local ZNE encodings

Maria Gragera Garces

Errors are the primary bottleneck preventing practical quantum computing. This challenge is exacerbated in the distributed quantum computing regime, where quantum networks introduce additional communication-induced noise. While error mitigation techniques such as Zero Noise Extrapolation (ZNE) have proven effective for standalone quantum processors, their behavior in distributed architectures is not yet well understood. We investigate ZNE in this setting by comparing Global optimization (ZNE is applied prior to circuit partitioning), against Local optimization (ZNE is applied independently to each sub-circuit). Partitioning is performed on a monolithic circuit, which is then transformed into a distributed implementation by inserting noisy teleportation-based communication primitives between sub-circuits. We evaluate both approaches across varying numbers of quantum processing units (QPUs) and under heterogeneous local and network noise conditions. Our results demonstrate that Global ZNE exhibits superior scalability, achieving error reductions of up to $48\%$ across six QPUs. Moreover, we observe counterintuitive noise behavior, where increasing the number of QPUs improves mitigation effectiveness despite higher communication overhead. These findings highlight fundamental trade-offs in distributed quantum error mitigation and raise new questions regarding the interplay between circuit structure, partitioning strategies, and network noise.

quant-pharXiv:2602.04981•IEEE Conference on Computer Communications (INFOCOM)•Feb 6, 2026•3 citations

Low-Depth and Noise-Resilient Quantum State Preparation for Partial Differential Equations via Virtual Rz

Toru Fujii

Preparing smooth real-amplitude quantum states is a key subroutine in quantum solvers for dissipative PDEs, such as LCHS, where discretized positive weights must be encoded into amplitudes. Exact state-preparation decompositions can reach unit fidelity ideally, but their two-qubit depth grows quickly and causes severe fidelity loss on NISQ hardware. We propose a low-depth, hardware-aware variational ansatz tailored to smooth, weakly entangled, near-real target distributions typical of damped PDE dynamics. The circuit uses one layer of local Ry rotations to generate real amplitudes, a nearest-neighbor CZ entangling layer to introduce limited entanglement, and additional Rz rotations implemented virtually as frame updates. Virtual Rz operations add no physical pulses and do not increase circuit duration, providing extra degrees of freedom without enlarging the gate footprint; in simulation they are treated as ideal to isolate their benefit. From a tensor-network viewpoint, the alternating structure restricts the state to a low-bond-dimension MPS, matching the target smoothness (for 3 qubits, bond dimension <= 2). We optimize parameters with COBYLA to minimize infidelity and benchmark against exact state preparation (Qiskit) and a RealAmplitudes (CZ) baseline. Under depolarizing noise representative of NISQ and early fault-tolerant regimes, the proposed single-layer circuit achieves high ideal fidelity with O(n) depth and substantially higher noisy fidelity than deeper exact constructions. In coherent-noise sweeps, virtual Rz parameters absorb systematic phase errors and axis mismatch, maintaining near-unity fidelity over a wide error range. These results indicate that virtual-Rz-enabled, low-depth circuits provide a practical, noise-resilient state-preparation primitive for PDE solvers on NISQ and early FTQC hardware.

quant-pharXiv:2608.17249•Aug 19, 2026•0 citations

Noise-Mitigated Variational Quantum Eigensolver with Pre-training and Zero-Noise Extrapolation

Wanqi Sun, Jungang Xu, Chenghua Duan

As a hybrid quantum-classical algorithm, the variational quantum eigensolver is widely applied in quantum chemistry simulations, especially in computing the electronic structure of complex molecular systems. However, on existing noisy intermediate-scale quantum devices, some factors such as quantum decoherence, measurement errors, and gate operation imprecisions are unavoidable. To overcome these challenges, this study proposes an efficient noise-mitigating variational quantum eigensolver for accurate computation of molecular ground state energies in noisy environments. We design the quantum circuit with reference to the structure of matrix product states and utilize it to pre-train the circuit parameters, which ensures circuit stability and mitigates fluctuations caused by initialization. We also employ zero-noise extrapolation to mitigate quantum noise and combine it with neural networks to improve the accuracy of the noise-fitting function, which significantly eliminates noise interference. Furthermore, we implement an intelligent grouping strategy for measuring Hamiltonian Pauli strings, which not only reduces measurement errors but also improves sampling efficiency. We perform numerical simulations to solve the ground state energy of the H4molecule by using MindSpore Quantum framework, and the results demonstrate that our algorithm can constrain noise errors within the range of $\mathcal{O}\left( {{{10}^{ - 2}}} \right)\sim \mathcal{O}\left( {{{10}^{ - 1}}} \right)$, outperforming mainstream variational quantum eigensolvers. This work provides a new strategy for high-precision quantum chemistry calculations on near-term noisy quantum hardware.

arXiv:2501.01646•IEEE International Conference on Acoustics Speech and Signal Processing•Mar 12, 2025•2 citations

Multi-Parameter Noise Geometry in Variational Quantum Circuits: A Layer-Resolved Extrapolation Framework Beyond Scalar ZNE

Kylymdar Omorov

Standard Zero-Noise Extrapolation (ZNE) in Variational Quantum Eigensolvers (VQE) assumes a single global noise scaling parameter, failing to capture heterogeneous and non-linear noise propagation across layered quantum circuits. We simulate VQE parameter optimisation at a challenging L=6 hardware-efficient depth, extracting the exact expectation values at each iteration. When the optimal parameters theta_star are found, they are fixed, and the multi-parameter noise surface is mapped. We propose a multi-parameter noise framework, modeling expectation values as a function of layer-wise noise scaling factors E(lambda_1, lambda_2, ..., lambda_L). Using structured unitary folding U_l = U_l (U_l^dagger U_l)^((lambda_l - 1) / 2), we independently scale the noise contribution of each ansatz layer and empirically map the resulting multi-dimensional noise surface. We analyze the separability of inter-layer noise interactions, identify layers with disproportionate error contributions via the gradient dE/dlambda_l, and compare scalar ZNE with multivariate polynomial regression and Gaussian Process (GP) extrapolation across H_2, LiH, and BeH_2 under depolarizing, amplitude damping, and coherent over-rotation noise. Our results demonstrate that noise is non-uniform and partially coupled across layers, and that layer-resolved ZNE with higher-order extrapolation can improve accuracy and variance under realistic NISQ noise models. These findings provide geometric insight into noise propagation in variational circuits and motivate targeted, layer-specific error mitigation strategies.

•Mar 29, 2026•0 citations

Distributed quantum computing via enhanced connectivity

Jiyao Liu

As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.

•Jun 11, 2026•0 citations
Distributed quantum processors could scale variational algorithms beyond single devices, but circuit depth, communication overhead, and noise limit their performance. We compare ladder, mixed-canonical, and brick-wall realizations of matrix-product-state (MPS) pretraining with matched per-layer two-qubit-block resources. Despite comparable ideal variational quantum eigensolver performance and gradient scales, the shallower brick-wall architecture reduces circuit duration, idle-time decoherence, and zero-noise-extrapolation (ZNE) overhead, yielding superior noisy and ZNE-assisted performance. We then extend MPS-pretrained circuits to modular processors with one communication qubit per quantum processing unit (QPU); a nearest-neighbor QPU-path schedule keeps the per-layer depth constant as QPUs are added. Distributed circuits whose inter-QPU links realize long-range interactions of the target Hamiltonian match or outperform the single-processor brick-wall under noise when communication idle time is short compared with the coherence time. These results establish hardware-aware co-design of tensor-network pretraining, circuit scheduling, and communication topology as a principle for variational quantum computation on noisy modular hardware.
The paper asks how circuit layout and communication scheduling affect MPS-pretrained VQE under finite-duration noise. It compares ladder, mixed-canonical, and brick-wall circuits with N−1N-1N−1 two-qubit blocks per layer, then extends brick-wall circuits to modular processors with one communication qubit per QPU. Evidence comes from noiseless and density-matrix simulations with gate-local Pauli errors, thermal relaxation during gates and idling, and folding-based zero-noise extrapolation (ZNE).
The single-processor layouts have nominal per-layer block depths N−1N-1N−1, ⌈N/2⌉\lceil N/2\rceil⌈N/2⌉, and 222, respectively, and comparable ideal VQE performance and sampled gradient scales in the tested regimes. For eight qubits and four layers, brick-wall gives mean unmitigated relative energy error 0.1590.1590.159, versus approximately 0.180.180.18 for the other layouts. Its noiseless error after ZNE-assisted training is 0.00180.00180.0018, versus 0.00270.00270.0027–0.00340.00340.0034. Controls attribute the noise advantage primarily to reduced idle-time decoherence.
A nearest-neighbor QPU-path schedule requires two communication rounds per layer, independent of QPU count; all-to-all communication requires linearly growing depth. Nine-qubit, two-/three-QPU simulations show connectivity–communication trade-offs: selected Hamiltonian-matched links outperform single-QPU brick-wall only in favorable communication regimes. With short gates and ZNE-assisted training, some advantages persist for inter-QPU gates ten times slower and noisier than local gates.
Limitations include phenomenological noise, exact expectations without shot noise, only eight-/nine-qubit noisy benchmarks, and at most three simulated QPUs. The principal Hamiltonian is a permuted Heisenberg chain; reordering removes the connectivity advantage. Pretraining mainly accelerates initial distributed optimization, and extrapolated energies can improve without improving the underlying noiseless state.
Preparing arbitrary quantum states requires exponential resources. Matrix Product States (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly rely on heuristic circuits that are deterministic but quickly saturate in accuracy, or on variational optimization methods that reach high fidelities but scale poorly. This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline. Heuristic staircase-like and brick wall disentangler circuits provide warm-start initializations for variational optimization, enabling high-fidelity state preparation for large systems. Target MPSs are either specified as physical quantum states or constructed from classical datasets via amplitude encoding, using step-by-step singular value decompositions or tensor cross interpolation. The framework incorporates entanglement-based qubit reordering, reformulated as a quadratic assignment problem, and low-level optimizations that reduce depths by up to 50% and CNOT counts by 33%. We evaluate the full pipeline on datasets of varying complexity across systems of 19-50 qubits and identify trade-offs between fidelity, gate count, and circuit depth. Optimized brick wall circuits typically achieve the lowest depths, while the optimized staircase-like circuits minimize gate counts. Overall, our results provide principled and scalable protocols for preparing MPSs as quantum circuits, supporting utility-scale applications on near-term quantum devices.
Errors are the primary bottleneck preventing practical quantum computing. This challenge is exacerbated in the distributed quantum computing regime, where quantum networks introduce additional communication-induced noise. While error mitigation techniques such as Zero Noise Extrapolation (ZNE) have proven effective for standalone quantum processors, their behavior in distributed architectures is not yet well understood. We investigate ZNE in this setting by comparing Global optimization (ZNE is applied prior to circuit partitioning), against Local optimization (ZNE is applied independently to each sub-circuit). Partitioning is performed on a monolithic circuit, which is then transformed into a distributed implementation by inserting noisy teleportation-based communication primitives between sub-circuits. We evaluate both approaches across varying numbers of quantum processing units (QPUs) and under heterogeneous local and network noise conditions. Our results demonstrate that Global ZNE exhibits superior scalability, achieving error reductions of up to 48%48\%48% across six QPUs. Moreover, we observe counterintuitive noise behavior, where increasing the number of QPUs improves mitigation effectiveness despite higher communication overhead. These findings highlight fundamental trade-offs in distributed quantum error mitigation and raise new questions regarding the interplay between circuit structure, partitioning strategies, and network noise.
Preparing smooth real-amplitude quantum states is a key subroutine in quantum solvers for dissipative PDEs, such as LCHS, where discretized positive weights must be encoded into amplitudes. Exact state-preparation decompositions can reach unit fidelity ideally, but their two-qubit depth grows quickly and causes severe fidelity loss on NISQ hardware. We propose a low-depth, hardware-aware variational ansatz tailored to smooth, weakly entangled, near-real target distributions typical of damped PDE dynamics. The circuit uses one layer of local Ry rotations to generate real amplitudes, a nearest-neighbor CZ entangling layer to introduce limited entanglement, and additional Rz rotations implemented virtually as frame updates. Virtual Rz operations add no physical pulses and do not increase circuit duration, providing extra degrees of freedom without enlarging the gate footprint; in simulation they are treated as ideal to isolate their benefit. From a tensor-network viewpoint, the alternating structure restricts the state to a low-bond-dimension MPS, matching the target smoothness (for 3 qubits, bond dimension <= 2). We optimize parameters with COBYLA to minimize infidelity and benchmark against exact state preparation (Qiskit) and a RealAmplitudes (CZ) baseline. Under depolarizing noise representative of NISQ and early fault-tolerant regimes, the proposed single-layer circuit achieves high ideal fidelity with O(n) depth and substantially higher noisy fidelity than deeper exact constructions. In coherent-noise sweeps, virtual Rz parameters absorb systematic phase errors and axis mismatch, maintaining near-unity fidelity over a wide error range. These results indicate that virtual-Rz-enabled, low-depth circuits provide a practical, noise-resilient state-preparation primitive for PDE solvers on NISQ and early FTQC hardware.
As a hybrid quantum-classical algorithm, the variational quantum eigensolver is widely applied in quantum chemistry simulations, especially in computing the electronic structure of complex molecular systems. However, on existing noisy intermediate-scale quantum devices, some factors such as quantum decoherence, measurement errors, and gate operation imprecisions are unavoidable. To overcome these challenges, this study proposes an efficient noise-mitigating variational quantum eigensolver for accurate computation of molecular ground state energies in noisy environments. We design the quantum circuit with reference to the structure of matrix product states and utilize it to pre-train the circuit parameters, which ensures circuit stability and mitigates fluctuations caused by initialization. We also employ zero-noise extrapolation to mitigate quantum noise and combine it with neural networks to improve the accuracy of the noise-fitting function, which significantly eliminates noise interference. Furthermore, we implement an intelligent grouping strategy for measuring Hamiltonian Pauli strings, which not only reduces measurement errors but also improves sampling efficiency. We perform numerical simulations to solve the ground state energy of the H4molecule by using MindSpore Quantum framework, and the results demonstrate that our algorithm can constrain noise errors within the range of O(10−2)∼O(10−1)\mathcal{O}\left( {{{10}^{ - 2}}} \right)\sim \mathcal{O}\left( {{{10}^{ - 1}}} \right)O(10−2)∼O(10−1), outperforming mainstream variational quantum eigensolvers. This work provides a new strategy for high-precision quantum chemistry calculations on near-term noisy quantum hardware.
Standard Zero-Noise Extrapolation (ZNE) in Variational Quantum Eigensolvers (VQE) assumes a single global noise scaling parameter, failing to capture heterogeneous and non-linear noise propagation across layered quantum circuits. We simulate VQE parameter optimisation at a challenging L=6 hardware-efficient depth, extracting the exact expectation values at each iteration. When the optimal parameters theta_star are found, they are fixed, and the multi-parameter noise surface is mapped. We propose a multi-parameter noise framework, modeling expectation values as a function of layer-wise noise scaling factors E(lambda_1, lambda_2, ..., lambda_L). Using structured unitary folding U_l = U_l (U_l^dagger U_l)^((lambda_l - 1) / 2), we independently scale the noise contribution of each ansatz layer and empirically map the resulting multi-dimensional noise surface. We analyze the separability of inter-layer noise interactions, identify layers with disproportionate error contributions via the gradient dE/dlambda_l, and compare scalar ZNE with multivariate polynomial regression and Gaussian Process (GP) extrapolation across H_2, LiH, and BeH_2 under depolarizing, amplitude damping, and coherent over-rotation noise. Our results demonstrate that noise is non-uniform and partially coupled across layers, and that layer-resolved ZNE with higher-order extrapolation can improve accuracy and variance under realistic NISQ noise models. These findings provide geometric insight into noise propagation in variational circuits and motivate targeted, layer-specific error mitigation strategies.
As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.