---
title: Quantum Asynchronous Advantage Actor-Critic
url: https://www.emergentmind.com/topics/quantum-asynchronous-advantage-actor-critic-qa3c
type: topic
---

# Quantum Asynchronous Advantage Actor-Critic

Quantum Asynchronous Advantage Actor-Critic (QA3C) denotes a family of hybrid quantum–classical reinforcement-learning methods that embed parameterized quantum models into the asynchronous advantage actor-critic paradigm. In the published formulations currently available, both the policy (“actor”) and the value estimator (“critic”) are realized by variational quantum circuits (VQCs) or related quantum modules, while asynchronous workers interact with separate environment instances and update shared global parameters. The 2023 formulation studies asynchronous training of advantage actor-critic variational quantum policies with “dressed” VQCs, and the 2025 formulation explicitly presents QA3C with adaptive non-local observables (ANO) as the measurement layer for both actor and critic [2301.05096], [2507.19629].

## 1. Research emergence and scope

The 2023 work situates QA3C in the broader development of quantum machine learning and quantum reinforcement learning, emphasizing that training QRL algorithms with VQCs requires significant amount of computational resources and proposing asynchronous training as a remedy. Specifically, it chooses the asynchronous training of advantage actor-critic variational quantum policies and reports numerical simulations in which, within the tasks considered, asynchronous training of QRL agents can reach performance comparable to or superior than classical agents with similar model sizes and architectures [2301.05096]. The 2025 work extends the design space by introducing an adaptive non-local observable paradigm within VQCs for QRL, and instantiates that paradigm inside both Deep Q-Network and Asynchronous Advantage Actor-Critic algorithms; in its A3C instantiation, the method is explicitly described as QA3C [2507.19629].

A central point in the literature is that QA3C is defined more by its training protocol and actor–critic decomposition than by a single canonical circuit ansatz. Both formulations share asynchronous worker-based optimization, separate actor and critic parameterizations, and policy-gradient learning with value baselines. They differ materially in state encoding, readout design, and which parts of the quantum model are trainable. This suggests that QA3C is best understood as a methodological class rather than a fixed architecture.

| Aspect | 2023 formulation | 2025 formulation |
|---|---|---|
| Quantum backbone | “dressed” VQC | ANO-VQC |
| Readout | measured expectation values $\langle Z \rangle$ plus classical post-processing | adaptive non-local observable $H(\phi)$ |
| Actor/critic parameters | separate $\theta$ and $\theta_v$ | separate $(\theta_{\text{actor}}, \phi_{\text{actor}})$ and $(\theta_{\text{critic}}, \phi_{\text{critic}})$ |
| Asynchrony | master process with $N=80$ workers, $S=5$ | spawn $N$ workers, segment length $t_{\max}$ |
| Baseline comparison | classical A3C with nearly matched parameter counts | classical A3C with local Pauli measurements and standard VQC-A3C |

## 2. Hybrid quantum–classical architectures

In the 2023 formulation, both actor and critic are parameterized by a “dressed” VQC placed between two small classical linear layers. A pre-processing layer maps the raw observation vector $s$ into an 8-dimensional real vector $x=(x_1,\ldots,x_8)$, one entry per qubit. The VQC core is an 8-qubit parameterized circuit with two variational layers, giving $8 \times 3 \times 2 = 48$ free parameters per VQC. A post-processing layer maps the 8 measured expectation values $\langle Z \rangle$ into a logit vector of length $|A|$ for the actor and into a single scalar $V(s)$ for the critic. The core circuit initializes each qubit in $|0\rangle$, applies a Hadamard gate, encodes each $x_i$ using $R_y(\arctan x_i)$ followed by $R_z(\arctan x_i^2)$, applies a ring of CNOTs, applies a three-parameter single-qubit rotation $R(\alpha_i,\beta_i,\gamma_i)$ on each qubit, repeats the entangling-and-rotation block for the second variational layer, and finally measures each qubit in the Pauli-$Z$ basis [2301.05096].

In the 2025 formulation, each of the actor and critic is a hybrid quantum–classical module built from an ANO-VQC. The architecture uses $n$ qubits; in CartPole experiments $n=4$, while in MiniGrid the high-dimensional raw observation is linearly projected down to 4 features and then assigned to 4 qubits. The encoding layer $W(s)$ has depth 1 and applies Hadamard on every qubit followed by single-qubit rotations $R_X(x_i)$ or $R_Y(x_i)$. The variational block $U(\theta)$ consists of $L$ layers of nearest-neighbour CNOT entanglers and single-qubit parameterized rotations $R(\theta_i)$, with typical choices $L=2$ for CartPole and $L=6$ for MiniGrid. The key innovation is the adaptive non-local observable $H(\phi)$ with $k$-local support acting as measurement; a sliding overlapping $k$-qubit window is used to generate $|A|$ outputs, and in all reported QA3C experiments $k=3$ [2507.19629].

The architectural contrast is consequential. In the 2023 design, measurement is fixed to local Pauli-$Z$ expectations and expressivity is concentrated in the variational circuit plus surrounding classical layers. In the 2025 design, the measurement operator itself becomes trainable. This suggests that published QA3C variants occupy different points in the trade space between circuit expressivity, classical post-processing, and measurement design.

## 3. Policy, value, and objective functions

For the 2023 dressed-VQC agent, the stochastic policy over a discrete action set $A$ is
$$
\pi_\theta(a|s)=\mathrm{Softmax}\bigl(W_{\mathrm{out}}\langle Z\rangle + b_{\mathrm{out}}\bigr)_a,
$$
where $\langle Z\rangle \in \mathbb{R}^8$ is the circuit output and $(W_{\mathrm{out}},b_{\mathrm{out}})$ are included in $\theta$. The advantage is defined as
$$
A(s_t,a_t)=Q(s_t,a_t)-V(s_t)\approx R_t-V(s_t;\theta_v),
$$
with $R_t=\sum_{k=0}^{T-t}\gamma^k r_{t+k}$ as the $n$-step return. The actor update uses the policy-gradient surrogate
$$
\nabla_\theta L_{\mathrm{actor}}=-\,\nabla_\theta \log \pi_\theta(a_t|s_t)\,A(s_t,a_t),
$$
while the critic minimizes
$$
L_{\mathrm{critic}}=\bigl(R_t-V(s_t;\theta_v)\bigr)^2.
$$
The actor objective may equivalently be written as
$$
J_{\mathrm{actor}}(\theta)\approx\mathbb{E}_{s_t,a_t\sim \pi_\theta}\bigl[\log \pi_\theta(a_t|s_t)\,A(s_t,a_t)\bigr],
$$
or, in minimization form,
$$
L_{\mathrm{actor}}(\theta)=-\,\log \pi_\theta(a_t|s_t)\,A(s_t,a_t).
$$
Gradients of circuit observables are computed via the parameter-shift rule
$$
\frac{\partial \langle Z\rangle}{\partial \alpha}
=\frac{1}{2}\langle Z\rangle_{\alpha+\pi/2}-\frac{1}{2}\langle Z\rangle_{\alpha-\pi/2},
$$
and these derivatives are auto-differentiated through the classical pre- and post-networks [2301.05096].

For the 2025 ANO-VQC formulation, the quantum state is
$$
|\psi(\theta,s)\rangle \coloneqq U(\theta)\,W(s)|0\rangle^{\otimes n}.
$$
For each action $a$, a distinct adaptive observable $H_a(\phi)$ is assigned, and the action score is
$$
f_{\theta,\phi}(s,a)=\langle \psi(\theta,s)|\,H_a(\phi)\,|\psi(\theta,s)\rangle.
$$
The actor policy is
$$
\pi_{\theta,\phi}(a|s)=\frac{\exp[f_{\theta,\phi}(s,a)]}{\sum_{a'}\exp[f_{\theta,\phi}(s,a')]},
$$
and the critic is
$$
V_{\theta',\phi'}(s)=\langle \psi(\theta',s)|\,H'(\phi')\,|\psi(\theta',s)\rangle.
$$
The per-time-step losses are
$$
L_\pi(t)=-\log \pi_{\theta,\phi}(a_t|s_t)\cdot A_t,
$$
$$
L_V(t)=\frac{1}{2}\bigl[G_t^{(n)}-V_{\theta',\phi'}(s_t)\bigr]^2,
$$
and
$$
L_{\mathrm{entropy}}(t)=-\beta \sum_a \pi(a|s_t)\log \pi(a|s_t).
$$
The overall per-worker loss is
$$
L=\sum_t [L_\pi(t)+c_v L_V(t)+L_{\mathrm{entropy}}(t)].
$$
A distinctive feature is that both $\theta$ and the observable parameters $\phi$ are jointly optimized, with a shift rule available for $\phi$ because $H(\phi)$ depends linearly on the matrix entries [2507.19629].

## 4. Asynchronous optimization mechanics

The 2023 method follows a canonical asynchronous setup with a master process holding global parameters $(\theta,\theta_v)$ and spawning $N$ independent workers; in the reported experiments, $N=80$ on an 80-core CPU. Each worker pulls a local copy $(\theta',\theta_v')\leftarrow(\theta,\theta_v)$, interacts with its own environment instance for up to $S=5$ steps or until terminal, accumulates gradients while working backward from the final step to the start of the segment, applies an atomic asynchronous optimizer step using Adam with $\mathrm{lr}=1\times 10^{-4}$, $\beta_1=0.92$, $\beta_2=0.999$, and then immediately refreshes its local parameters from the global state. No replay buffer is needed. The paper states that the parallelism both decorrelates training samples and greatly speeds up wall-clock training [2301.05096].

The 2025 formulation preserves the same asynchronous actor-critic logic while expanding the parameter state to four sets:
$$
(\theta_{\text{actor}}, \phi_{\text{actor}};\theta_{\text{critic}}, \phi_{\text{critic}}).
$$
Each worker interacts with its own copy of the environment for up to $t_{\max}$ steps, collects tuples $(s_t,a_t,r_t,s_{t+1})$, computes the $n$-step return
$$
G_t^{(n)}=\sum_{i=0}^{n-1}\gamma^i r_{t+i}+\gamma^n V(s_{t+n}),
$$
and forms the advantage estimate $A_t=G_t^{(n)}-V(s_t)$. Local gradients are then computed for actor and critic, including both circuit and observable parameters, and applied asynchronously to the shared global parameters in Hogwild! style. The reported optimizer is RMSProp with learning rate $\alpha=10^{-4}$, discount $\gamma=0.99$, entropy weight $\beta=0.01$, and value weight $c_v=0.5$ [2507.19629].

Across both versions, the defining operational feature of QA3C is therefore not merely the presence of a quantum policy network, but the coupling of that network to many asynchronously updating environment workers. In both papers, the actor–critic decomposition is used to reduce variance relative to pure return-based updates, while asynchronous parallelism is used to improve sample decorrelation and training throughput.

## 5. Benchmark configurations and reported performance

In the 2023 study, the environments are Acrobot, Cart-Pole, and MiniGrid-SimpleCrossing. Acrobot uses a 6-dimensional observation, 3 discrete actions, reward $-1$ per step, and success threshold $-100$. Cart-Pole uses a 4-dimensional observation, 2 actions, and reward $+1$ per step until failure. MiniGrid-SimpleCrossing uses a 147-dimensional compact observation, 6 actions, and a sparse reward of 1 at goal minus step penalty, with three variants having 1–3 valid wall crossings. Shared hyperparameters are $N=80$, update horizon $S=5$, discount factor $\gamma=0.9$, and 8-qubit two-layer VQCs, yielding 48 parameters per circuit and total quantum parameters of 96 for actor plus critic. The classical baseline uses the identical network layout except that the 8-qubit VQC is replaced by a single classical linear layer $8\to 8$, so total parameter counts are nearly matched. All runs use 100 000 training episodes and report the moving average over the past 100 episodes. On Acrobot, the QA3C agent steadily improves and converges to the goal threshold faster and more stably than the classical baseline, which struggles to climb out of local minima. On Cart-Pole, the classical baseline learns slightly faster in the first $\sim 10\,000$ episodes, but the QA3C agent overtakes and reaches higher final average reward with fewer fluctuations. On SimpleCrossing, for the $N=2$ and $N=3$ variants the QA3C agent converges significantly faster and to higher returns than the classical A3C, while in the easiest $N=1$ case both methods perform similarly [2301.05096].

In the 2025 study, the reported QA3C tasks are CartPole, MiniGrid-$8\times 8$, and MiniGrid-SimpleCrossing S9N1. CartPole uses $n=4$ qubits and $|A|=2$; the MiniGrid tasks reduce observations to 4 features and use $|A|=3$. Each experiment is averaged over 5 seeds, and the reported metrics are episode return for CartPole and success rate for MiniGrid. On CartPole, QA3C with ANO and $k=3$ reaches an average return of 400 within $\sim 12\,000$ episodes, versus $>25\,000$ for classical A3C with local Pauli measurements, and fails entirely when only $R$ or only measurement is used. On MiniGrid-$8\times 8$, QA3C attains $>95\%$ success in $\simeq 7\,000$ episodes, whereas standard VQC-A3C plateaus at $\simeq 80\%$. On SimpleCrossing, QA3C reaches $80\%$ success, VQC-A3C reaches $40\%$, and measurement-only reaches $30\%$ [2507.19629].

Taken together, the published evidence supports a narrower but technically specific conclusion: under the reported simulated benchmark conditions, QA3C matches or surpasses classical A3C baselines and local-measurement VQC baselines with comparable or explicitly stated architectures. The stronger claim of a general quantum advantage is not established in these papers; rather, the reported improvements are benchmark- and implementation-specific.

## 6. Measurement design, limitations, and research directions

A major methodological divergence between the two formulations concerns measurement. The 2023 method uses fixed local Pauli-$Z$ measurements and relies on the VQC plus surrounding classical layers for representational capacity. The 2025 method promotes measurement to a trainable object by introducing a $k$-local Hermitian observable
$$
H(\phi)=[h_{ij}(\phi)]_{i,j=1\ldots 2^k},
$$
with
$$
h_{ii}=c_{ii}, \qquad h_{ij}=a_{ij}+i\,b_{ij}, \qquad h_{ji}=a_{ij}-i\,b_{ij},
$$
and total parameter count approximately $2^k(2^k+1)/2$. The paper’s ablation results state that measurement locality $k$ controls expressive power: on MountainCar in DQN, performance improves markedly from $k=3 \to 6$, with diminishing returns beyond $k=6$, and once $k$ is large enough, measurement-only matches the performance of full ANO. The same study explicitly describes a “depth $\leftrightarrow$ measurement” trade-off, according to which one may increase $k$ and the $\phi$-parameter count instead of increasing circuit depth $L$ [2507.19629].

The main limitations are also explicit. In the 2023 study, all experiments are simulated and no real QPU hardware was used; the authors note that noise, limited qubit connectivity, and measurement error on current NISQ devices may degrade performance. The circuits remain shallow, with two variational layers, to stay within NISQ constraints, and deeper circuits are presented as a possible route to greater expressivity but one that would require error mitigation [2301.05096]. The 2025 study similarly frames shallow circuits as desirable because deeper circuits exacerbate noise on NISQ hardware, and positions ANO as a way to improve expressivity without adding circuit depth [2507.19629].

Several future directions are stated directly in the literature. The 2023 paper identifies deployment on multi-QPU or cloud-accessed hardware with true quantum parallelism among workers, more advanced advantage estimation such as generalized advantage estimation or entropy regularization, hybrid encodings such as amplitude or basis encoding for higher-dimensional inputs, and extensions to continuous action spaces such as quantum soft-actor-critic [2301.05096]. The 2025 paper points instead toward scaling expressive measurements and exploiting the depth-versus-measurement trade-off [2507.19629]. A plausible implication is that future QA3C research will increasingly treat readout design, not only ansatz design, as a primary control knob for reinforcement-learning performance.

Source: https://www.emergentmind.com/topics/quantum-asynchronous-advantage-actor-critic-qa3c