text:
\section{Introduction}
\label{sec:intro}
\input{tex/intro.tex}
\section{Background and Motivation}
\label{sec:back}
\input{tex/background.tex}
\section{Related Work}
\label{sec:related}
\input{tex/related.tex}
\section{DigiQ quantum controller}
\label{sec:scheme}
\input{tex/scheme.tex}
\section{Software calibration of SIMD hardware}
\label{sec:simd}
\input{tex/simd.tex}
\section{Methodology and Results}
\label{sec:results}
\input{tex/results.tex}
\section{Conclusions and Future work}
\label{sec:conclusion}
\input{tex/conclusion.tex}

\section*{Acknowledgment}

This work is funded in part by EPiQC, an NSF Expedition in Computing, under grants CCF-1730082/1730449; in part by STAQ under grant NSF Phy-1818914; in part by DOE grants DE-SC0020289 and DE-SC0020331; and in part by NSF OMA-2016136 and the Q-NEXT DOE NQI Center. This work was completed in part with resources provided by the University of Chicago's Research Computing Center.

\let\oldbib\thebibliography
\def\thebibliography#1{\oldbib{#1}\setlength{\itemsep}{5pt}}
\bibliographystyle{IEEEtran}

\subsection{Quantum computing}
A quantum algorithm specifies a series of transformations on quantum systems called qubits, which are analogous information carriers to classical bits. The state of a single qubit can be represented as a linear combination of two states:
\begin{align*}
    \ket{\psi} = \alpha \ket{0} + \beta \ket{1}
\end{align*}
where the {amplitudes} $\alpha, \beta \in \mathbb{C}$ satisfy $|\alpha|^2 + |\beta|^2 = 1$.
It is useful to visualize the state of a single qubit as a vector on the unit Bloch sphere as shown in Fig. \ref{fig:sfq_single_q}(a), where $\alpha=\cos\theta/2$ and $\beta=e^{i\phi}\sin\theta/2$.
A multi-qubit state may be written as
    $\ket{\psi} = \sum_i \alpha_i \ket{i}$,
where $\sum_i|\alpha_i|^2=1$ and $\ket{i}=\ket{i_{n-1}}\ldots\ket{i_1}\ket{i_0}$ are the computational basis states of the $n$-qubit quantum system.

\emph{Quantum gates} are unitary operators which modify the state of the qubit system. Any single-qubit gate can be represented as a rotation on the unit Bloch sphere (see Fig. \ref{fig:sfq_single_q}(a)). Rotations around any two axes can be combined to perform arbitrary single-qubit gates. Combined with
a two-qubit \emph{entangling} gate (i.e., a gate which cannot be decomposed into one-qubit gates), this is sufficient for universal quantum computation \cite{Barenco1995}.

\begin{figure}[t!]
    \centering
    \includegraphics[width=0.4\textwidth]{figs/bloch.pdf}
    \caption{(a) Bloch sphere representation of a qubit;
    (b) SFQ driven trajectory. The blue trajectory is driven by the periodic SFQ pulse train shown in (c), and the orange trajectory is driven by the qubit free evolution; (c) SFQ pulse train in the time domain.
    $f$ is the qubit oscillation frequency.
    }
    \label{fig:sfq_single_q}
    \vspace{-12pt}
\end{figure}

\subsection{Superconducting qubit controllers and their limitations}
\label{sec:background:control}

Superconducting qubits are nonlinear LC circuits built with Josephson junctions (JJ) that operate at near absolute zero temperature and oscillate at microwave frequencies.
Qubits are defined using the quantized ground ($\ket0$) and first excited ($\ket1$) states of the oscillator, where the qubit's oscillation frequency is defined as the energy difference between the two levels.
\emph{Transmons} are a simple form of superconducting qubit comprising a JJ and a shunt capacitor, designed to reduce the qubit's sensitivity to electrical charge noise~\cite{transmon}, and is the qubit technology in many state-of-the-art systems \cite{google_machine1}.
\emph{Flux-tunable} transmons allow tuning the qubit oscillation frequency, and are implemented by replacing the transmon's JJ with a pair of parallel junctions separated by a small distance. The qubit frequency can then be shifted by driving an external magnetic flux (using a small electrical current, $\sim$1 mA) through the enclosed loop \cite{quantum_eng}.
The relationship between frequency and flux can be fine tuned by varying the parameters of each JJ individually, creating what's known as an \emph{asymmetric} transmon \cite{hutchings2017}.

Superconducting quantum computer prototypes perform single-qubit gates by driving transitions between the oscillator's $\ket0$ and $\ket1$ states using microwave pulses.
Controllable multi-qubit operations require a means of selectively interacting qubits through some coupling architecture.
Two-qubit gates such as
$\text{CZ}$ can be implemented using flux-tunable transmons by changing the frequency of the qubits temporarily such that their quantum states are on resonance \cite{quantum_eng}.

\revc{Superconducting quantum computers have received significant attention due to their convenient qubit design and configurability \cite{quantum_eng}, leading to rapid advances in their size, coherence time, and gate fidelity \cite{google_machine1,google_machine2,ibm_machine}.
However, they also pose significant challenges which must be addressed for superconducting quantum computing to be scalable.
Superconducting qubits need cooling to very low temperatures ($\sim$20 mK) which is expensive and complicates control hardware. Further, unlike technologies such as trapped ion (in which qubit uniformity is guaranteed by nature \cite{trappedidentical}), the characteristics of superconducting qubits are subject to variation and drifts over time.}

The controller design in today's prototypes relies on separate cables from room temperature to control individual qubits \cite{google_machine1}. This approach has severe scalability issues. First, there is a massive electronics cost for generating and routing the analog control pulses from room temperature including the cost of arbitrary waveform generators (AWGs), microwave sources, IQ mixers (which modulate the in-phase and out-of-phase components of the drive signal \cite{quantum_eng}),
and amplifiers and attenuators that are used for thermal property matching at each stage of the fridge \cite{mcdermott_fab, quantum_eng, mcdermott_full}. Second, the cooling power at millikelvin stage of the fridge is very limited ($<$10 $\mu$W \cite{qarch_hornibrook}) and a large number of high bandwidth coaxial cables create a big heat load problem at this stage. Thus, alternative quantum controller architectures are needed to realize scalable and robust quantum machines.

\subsection{Opportunities and challenges of SFQ quantum controllers}
Superconducting Single Flux Quantum (SFQ) is a magnetic-pulse based device and a single quantum of magnetic flux, $\Phi_0$ = $h/2e$ = $2.07$ mV$\cdot$ps, is used for logic bit representation. In this representation, presence of a pulse has the meaning of ``logic-1", while absence of a pulse is considered as a ``logic-0". Operation of SFQ logic is based on overdamped JJs \cite{herr2011ultra,takeuchi2013adiabatic,sfq_logic2,sfq_logic1,volkmann2013experimental}.
There are two types of D-Flip-Flops (DFFs) in this technology: Destructive Read Out (DRO) DFF and Non-Destructive Read Out (NDRO) DFFs. In the first type the stored data will be erased after one read operation and the DFF will be reset back to its zero state. However, in the second type, multiple read operations can be done without erasing the content of DFF.
SFQ devices with switching delay of {1 ps} and switching energy of $10^{-19}$ J are considered great candidates to provide high speed solutions post-silicon and post-CMOS \cite{supernpu}.
Moreover, these Niobium-based devices are extremely low power and despite their cryo-cooling overhead they still consume significantly less power compared to the state-of-the-art silicon-based devices \cite{mukhanov2011energy}. These unique properties make SFQ an attractive logic technology to implement classical controllers with maximized scalability for quantum computers.

SFQ can be utilized not only to implement classical controller logic, but also to perform quantum gates locally. Prior work demonstrated that SFQ pulse trains can be utilized to perform single-qubit gates \cite{mcdermott2014,sfq_genetic, mcdermott_fab}.
For example, an intuitive approach to do rotations along the y-axis, $Ry(\theta)$, is to apply one SFQ pulse every qubit oscillation period as shown in Fig. \ref{fig:sfq_single_q}. The time integral of an SFQ pulse is equal to the superconducting flux quantum and determines the energy deposited in the qubit. The result of this energy deposition is a small rotation of $\delta \theta$ around the y-axis. We can perform a rotation along the y-axis by keep applying one SFQ pulse every qubit period. An arbitrary single-qubit gate can be represented by a bitstream (denoted as SFQ bitstream); the gate is applied by applying the SFQ bitstream to the qubit, one bit at a time: if the bit is 1 (0), we apply (don't apply) an SFQ pulse to the qubit at the corresponding SFQ chip cycle.

Despite its high potentials, SFQ imposes unique constraints on the controller design. First, limited JJ density in existing technology (100X-10,000X \revc{lower density} than CMOS \cite{qarch_swamit2}) leads to lack of dense memory/logic in SFQ. Second, SFQ design is different from that of CMOS due to unconventional pulse-driven nature of SFQ logic.
SFQ logic gates receive clock signals and they are evaluated by arrival and consumption of clock pulses. Therefore, balancing the circuit path by inserting extra DFFs is essential to ensure that inputs are consumed at correct clock cycles \cite{pasandi2019dynamic}.
The extra DFFs further increase the logic area (and power), and might incur significant costs in complex logic designs. Thus, we need to take these constraints into consideration and (1) use limited SFQ storage; (2) keep the logic simple.

\subsection{SFQ-based universal quantum computation}

\subsubsection{Design space for single-qubit gate controllers}
\label{sec:scheme:one-qubit}

A naive design to do arbitrary single-qubit gates is to allocate separate SFQ registers for SFQ bitstreams per qubit (similar to \cite{mcdermott_full}) and update them as needed. This design, denoted as \sfqnaive/, is similar in spirit to today's microwave-based designs, but relies on digital communication from room temperature rather than analog communication. \sfqnaive/ is straightforward and provides quantum gate parallelism (i.e., multiple instruction, multiple
data (MIMD) paradigm). However, it requires high communication bandwidth from room temperature in scenarios where we are not primarily repeating the same quantum gates, and thus need to update a large number of SFQ registers on-the-fly during the quantum program execution.
In addition, \sfqnaive/ is expensive in terms of power and area (5.01 mW/qubit and 13.9 mm$^2$/qubit just for 300-bit SFQ registers based on our results obtained using detailed SFQ synthesis tools and cell libraries).
Thus, the scalability of \sfqnaive/, is limited by power/area/bandwidth.

In order to reduce the required bandwidth from room temperature, we can store a universal single-qubit gate set per qubit on the SFQ chip, and send the quantum gate decomposition information from the room temperature. In the simplest case where the single-qubit gate set includes two gates, we need to send only 1 bit per qubit at any given time from room temperature to select/apply one of the two gates. This design, denoted as \sfqmimd/, reduces the bandwidth requirement significantly compared to \sfqnaive/. However, it further increases the power and area as it allocates more than one SFQ register per qubit. Thus, the scalability of \sfqmimd/ is still limited by power/area.

Finally, we demonstrate our scalable design. Tight power, area, and bandwidth budget of dilution refrigerators, and lack of dense memory in SFQ (see Sec. \ref{sec:back}) leads us to a design where we share SFQ bitstreams among a group of qubits (i.e., SIMD). \revc{Grouping is static and done at the design time, such that qubits in a group have the same nominal oscillation frequency; we show that we can compensate for frequency drift in software in \cref{sec:simd}.} Note that sharing the bitstreams can be done efficiently in SFQ by broadcasting the bitstreams (one bit per SFQ cycle) using splitter gates. This design, denoted as \sfqsimd/, is a potential candidate to realize a controller with high scalability thanks to its reduced power, area, and bandwidth requirements compared to the other two designs. We therefore base \dq/ on this design.
Table \ref{tab:mimdsimd} summarizes the investigated design space.

\subsubsection{Single-qubit gate decomposition}
Out of the plethora of proposed quantum gate decomposition protocols for single-qubit gates, we must choose the ones that can be implemented efficiently using SFQ. We prefer a decomposition protocol that relies on storing/processing a limited number of SFQ bitstreams (see Sec. \ref{sec:back}). This is important because (1) there is a lack of dense memory in SFQ, thus we can afford to store only a limited number of SFQ bitstreams; (2) we need to keep the SFQ logic simple, thus we can afford to process only a limited number of SFQ bitstreams at any given time. We consider two SFQ-friendly gate decompositions and present their corresponding SFQ-based architecture designs.

Our first architecture, denoted as \dqmin/, is based on a minimal universal single-qubit gate set that includes only 2-4 gates (e.g., $[Ry(\frac{\pi}{2}),T]$ is sufficient for universal single-qubit computation \cite{kitaev1997,solovaykitaev}) with the goal of minimizing the hardware cost. Our digital controller works with a clock (denoted as \emph{quantum controller clock}), and similar to classical computers, each quantum program is decomposed into a number of quantum gates and each quantum gate is finished in a number of controller cycles. In \dqmin/, single-qubit gates are decomposed into a sequence of the gates in the gate set, and each gate of the sequence is executed in one controller cycle. At the beginning of each controller cycle, the SFQ bitstreams corresponding to all the gate are broadcasted to a group of qubit controllers. Each qubit controller uses a simple SFQ-based multiplexer to select/apply one of the possible bitstreams using the control bits that are sent from the room temperature in each controller cycle.

A concern is that \dqmin/ needs long gate sequences to perform arbitrary single-qubit gates.
Thus, we also present \dqopt/, in which
we implement the continuous gate set $\{Ry(\frac{\pi}{2}),Rz(\phi);\phi\in[0,2\pi)\}$, enabling constant-depth single-qubit gate decomposition \cite{virtualz}.
$Ry(\frac{\pi}{2})$ can be implemented by storing an SFQ bitstream on the SFQ chip.
The next question is: how to implement $Rz(\phi)$ gates for arbitrary $\phi$ efficiently?

In microwave-based systems, $Rz(\phi)$ gates can be done virtually (in software) by changing the phase of the microwave pulses of the consecutive gates \cite{quantum_eng,virtualz}. But, in the SFQ case, we do not have control over the phase of the SFQ bitstream. Thus, we need to perform the $Rz(\phi)$ gates in hardware. Thanks to the ultra-fast, precise clock on the SFQ chip (in the order of ps), we can perform arbitrary $Rz(\phi)$ by letting the qubits evolve freely for a precise number of SFQ chip clock cycles, which is equivalent to applying an SFQ bitstream consisting of only ``0'' bits.
Every qubit oscillation period, a qubit performs a full rotation around the z-axis with a trajectory in the form of a unit circle (see Fig. \ref{fig:sfq_single_q}). Now, for any $\phi$, there is a point on the unit circle corresponding to $Rz(\phi)$ and we need to get as close as possible to that point in order to perform $Rz(\phi)$ with high fidelity.
By applying a ``0'' bit every SFQ chip cycle, we get to multiple points on the unit circle in one qubit oscillation period, and we cover more points if we let the qubit evolve freely for more than one qubit period.
The longer we let the qubit evolve freely, the more points we can get to on the unit circle and the more precisely we can approximate $Rz(\phi)$ for arbitrary $\phi$.
The fidelity of these gates is analyzed in Sec. \ref{sec:simd:1qb}.

We now discuss implementation details of \dqopt/ single-qubit gates.
Any one-qubit gate can be decomposed as $U(\phi_3,\phi_2,\phi_1) = Rz(\phi_3)Ry(\frac{\pi}{2})Rz(\phi_2)Ry(\frac{\pi}{2})Rz(\phi_1)$.
In \dqopt/, we break the $U(\phi_3,\phi_2,\phi_1)$ into three parts, $Ry(\frac{\pi}{2})Rz(\phi_1)$, $Ry(\frac{\pi}{2})Rz(\phi_2)$, and $Rz(\phi_3)$. We perform each of the first two parts in one controller cycle,
and absorb the $Rz(\phi_3)$ to the next controller cycles. The controller cycle length is equal to the $Ry(\frac{\pi}{2})$ gate time plus $N*SFQ\_chip\_cy\-cle\_length$, where $N$ is the maximum number of SFQ chip cycles that we let the qubits evolve freely in order to perform $Rz(\phi)$ gates. We perform $Ry(\frac{\pi}{2})Rz(\phi)$ by applying a ``0'' bitstream of length $0 \leq d \leq N$ followed by the $Ry(\frac{\pi}{2})$ bitstream, which is equivalent to delaying the $Ry(\frac{\pi}{2})$ bitstream by $d$ SFQ chip cycles as shown in Fig. \ref{fig:digibase}. The value of $d$ depends on the angle $\phi$ and is sent by the compiler at room temperature every controller cycle; the SFQ logic in \dqopt/ delays the stored $Ry(\frac{\pi}{2})$ bitstream by $d$ SFQ chip cycles and broadcasts it to a group of qubit controllers. The residual $Rz(\gamma)$ rotation at the end of the controller cycle (see Fig. \ref{fig:digibase}) can be absorbed into the next gate on that qubit.

The next question is: how many distinct $Ry(\frac{\pi}{2})Rz(\phi)$ gates out of a total of $N+1$ possible gates (denoted as $BS$) are needed every controller cycle? The answer depends on (1) the available power and area budget inside the fridge: providing more distinct gates requires more complex logic to delay the stored $Ry(\frac{\pi}{2})$ bitstream by more distinct values at the same time, and also broadcast and process more SFQ bitstreams; (2) the similarity between the gates that qubits inside a group perform in a given instant: there will be serialization inside a group if not enough distinct gates are available in a controller cycle. The lower the $BS$ value, the lower the hardware cost but the higher the chance of serialization (see Sec. \ref{sec:results}).

\begin{figure}[t!]
  \begin{center}
  \includegraphics[width=0.98\linewidth]{figs/digiq_cycle.pdf}
  \caption{The sequence of gates in one cycle of \dqopt/.}
  \label{fig:digibase}
  \end{center}
  \vspace{-10pt}
\end{figure}

\begin{figure}[t!]
  \centering
  \begin{tabular}[b]{c}
    \includegraphics[width=.8\linewidth]{figs/cz_circuit.pdf} \\
    \small (a)
  \end{tabular} \qquad
  \begin{tabular}[b]{c}
    \includegraphics[width=.7\linewidth]{figs/cz_current.pdf} \\
    \small (b)
  \end{tabular}
  \vspace{-10pt}
  \caption{(a) Circuit schematic of our current generator design based on SFQ/DCs; (b) The electrical current pulse generated by our design to realize $\text{CZ}$ gates on flux-tunable transmons.}
  \label{fig:CZ}

  \vspace{-12pt}
\end{figure}

\subsubsection{Two-qubit gate design}
\label{sec:scheme:2qubit}
In this paper, we develop SFQ circuits to generate electrical current waveforms necessary to realize $\text{CZ}$ gates on flux-tunable transons (see Sec. \ref{sec:back}) inside the fridge. The electrical currents are transmitted to the quantum chip using superconducting microstrip flex lines (see Fig. \ref{fig:CZ}(a)).
We deploy an array of SFQ/DCs, which are commonly used SFQ blocks to convert the SFQ pulsed representation to DC voltage levels \cite{sfqdc}.
When a \emph{start} signal is received by the SFQ/DC blocks, they start outputting electrical current, and they keep doing so until they receive a \emph{stop} signal (we need to turn the SFQ/DCs on (off) in the beginning (end) of the $\text{CZ}$ gate).
In order to target specific pairs of qubits on a multi-qubit system we require current waveforms to be applied to both qubits simultaneously (we need one current generator per qubit).
The only difference between this approach and prior flux-tunable implementation of CZ gates is that the electrical current is generated inside the fridge. Note that we use the same two-qubit gate design for both \dqmin/ and \dqopt/.

We use JSIM which is a detailed circuit simulator for superconductive electronic applications \cite{jsim} to simulate the Fig. \ref{fig:CZ}(a) current generator circuit. Fig. \ref{fig:CZ}(b) shows the simulated current waveform,
which is generated by enabling 25 SFQ/DC blocks (the values of $R1$, $R2$, and $C1$ are 0.05 ohm, 0.05 ohm, and 10 nF, respectively).
In Sec. \ref{sec:simd:2qb}, we use physical simulations to show that this waveform can be combined with software calibration techniques to realize low-error CZ gates even when qubits exhibit independent frequency variation.

Recent studies have also suggested realizing two-qubit cross-resonance gates using only SFQ pulses \cite{jokarqce,alphazero}.
The design of an SFQ controller architecture based on such gates would present a different set of challenges and opportunities, the study of which we save for future work.

\begin{figure}[t!]
  \begin{center}
  \includegraphics[width=0.95\linewidth]{figs/overview.pdf}
  \caption{Overview of our \dq/ architecture.}
  \label{fig:overview}
  \end{center}
  \vspace{-17pt}
\end{figure}

\subsection{Overview of \dq/ architecture}
\label{sec:schemeoverview}
Now we put it all together and demonstrate an overview of our \dq/ architecture that is shown in Fig. \ref{fig:overview}. There are \emph{G} groups of qubit controllers. At the beginning of each controller cycle, \emph{BS} distinct single-qubit SFQ gates per each group are broadcasted to all the qubit controllers in the group. \emph{BS\_sel} bits are used to select the \emph{BS} distinct single-qubit gates in \dqopt/
(\dqmin/ does not need \emph{BS\_sel} bits since its universal single-qubit gate set includes only a few gates, which are all broadcasted).
Each qubit controller uses an SFQ-based multiplexer and the \emph{1q\_sel} bits to either select/apply one of the \emph{BS} delayed bitstreams, or apply none of them (e.g., in the two-qubit gate case). For two-qubit gates, the qubit controllers of the two qubits involved use the \emph{2q\_sel} bits to determine whether to start/stop performing CZ gate by sending \emph{start/stop} signals to the SFQ/DCs.

\emph{BS\_sel}, \emph{1q\_sel}, and \emph{2q\_sel} control bits are sent from the room temperature every controller cycle using \emph{Ctrl. data} cables; a \emph{Valid} cable is used to determine the validity of control data on data cables. A \emph{Load} cable is also used to load the SFQ bitstreams through the data cables, which is done offline (i.e., not during the program execution); each SFQ bitstream has $\le$300 bits (the actual bitstream length depends on the target gate and system Hamiltonian). After the transmission of the control bits of the first controller cycle is finished, a \emph{Go} signal is sent from room temperature to start the controller clock (which is implemented using a counter that counts up every SFQ chip cycle and resets every controller cycle).
At the beginning of every controller cycle,
the control bits that are already buffered in a buffer (\emph{Buffer\#1} in Fig. \ref{fig:overview}) are transferred to a second buffer (\emph{Buffer\#2} in Fig. \ref{fig:overview}) to be used by qubit controllers and SFQ bitstream generators. While executing the current controller cycle, the control bits of the next controller cycle are buffered in the first buffer.

\subsection{Hardware results of \dq/}
We use detailed SFQ synthesis tools \cite{pasandi2019balanced, pasandi2018sfqmap, pasandi2019pbmap, pasandi2019dynamic, pasandi2019efficient} to synthesize, map, and finally calculate the power, area, and delay values. The employed synthesis and technology mapping flow is as follows: first, technology-independent optimizations including balanced factorization and rewriting \cite{pasandi2019balanced} are performed on the input circuit, then the circuit is mapped using a path balancing technology mapping algorithm \cite{pasandi2019dynamic} and fully path balanced \cite{pasandi2019pbmap}. Next, a standard retiming algorithm similar to \cite{leiserson1991retiming} is employed to further reduce the total memory element count. Finally, the memory elements (e.g., latches) are replaced with SFQ DRO DFFs, and splitters are inserted at the output of gates with more than one fanout.

Rapid Single Flux Quantum (RSFQ) logic family \cite{sfq_logic2} is used in this paper, and the library of cells is listed in Table \ref{table:cells}.
For wiring, we use Josephson Transmission Line (JTL) and Passive Transmission Line (PTL). JTL is used for short connection for cells next to each other and its delay is $\sim$1.5-2 ps.
PTL is used for transmitting SFQ pulses from one logic gate to another.

\subsubsection{Validity of our synthesis results}
We have the physical layouts for all cells, including wires and logic cells. Our RSFQ power, area and delay numbers are obtained post-layout based on accurate extraction of the gate layouts and passive transmission lines and subsequently simulated using WRSpice \cite{wrspice} and JSim \cite{jsim}. The simulation results are thus highly accurate and reliable. The SFQ library cells have been validated and their power/timing values calibrated against manufactured test chips done in the MIT Lincoln lab's SFQ5ee process node \cite{sfq5ee}. The synthesis, place\&route, modeling/simulation, and formal verification tools have been used to design and formally/simulatively verify tens of SFQ circuits ranging from individual data path modules and register files to major building blocks of the RISC-V Sodor core \cite{haolin,coldflux,sodor}. In addition, prior work validated comparable SFQ tools and simulators with SFQ chip fabrication \cite{supernpu}.

\subsubsection{Delay results}
Our synthesis results show that the worst stage delay in \dq/ is 34.5 ps, which determines the maximum clock frequency that our SFQ chip can work with. We choose 40 ps as our SFQ chip clock period (similar to \cite{mcdermott_kangbo}), thus the bit period in our SFQ bitstreams is 40 ps.

\captionsetup[subfigure]{labelformat=empty}
\begin{figure}[!t]
\begin{center}
\subfloat    {
\includegraphics[width=0.92\linewidth]{figs/legend.pdf}
}\\
\subfloat [(a)]    {
\includegraphics[width=0.87\linewidth]{figs/power.pdf}
} \\\vspace{-5pt}
\subfloat  [(b)]   {
\includegraphics[width=0.87\linewidth]{figs/area.pdf}
} \\\vspace{-5pt}
\subfloat [(c)]    {
\includegraphics[width=0.87\linewidth]{figs/cable.pdf}
}
\caption{Power (a), area (b), and cable count (c) results of \dqmin/ and \dqopt/ architectures. \revc{\sfqnaive/ and \sfqmimd/ results are shown for comparison.}}
\vspace{-25pt}
\label{fig:area_pow}
\end{center}
\end{figure}

\subsubsection{Power and area results}
\label{sec:pow}
Fig. \ref{fig:area_pow}(a) and Fig. \ref{fig:area_pow}(b) show the total power and area of \dq/, respectively. We present the results for different $BS$ and $G$ values.

As mentioned in Sec. \ref{sec:scheme:one-qubit}, in \dqopt/, only $BS$ distinct delays are available every controller cycle for single-qubit gates, and that can potentially lead to quantum gate serialization inside a group. One solution to mitigate this serialization is to increase the value of $BS$, which would increase the hardware cost of quantum controller modules as they would need more complex SFQ-based multiplexers to select one out of a larger number of delayed bitstreams (see Fig. \ref{fig:overview}). Another solution to mitigate the serialization is to increase the $G$ value. This solution decreases the number of qubits per each group which means less congestion and less serialization, while not increasing the hardware cost of gate controller modules. Thus, at the design time, we expected that among all the designs with the same $BS*G$, the ones with higher $G$ value have lower hardware cost as they need less complex quantum controller modules. However, our synthesis results surprised us. As shown in Fig. \ref{fig:area_pow}, the hardware cost of the designs with the same $BS*G$ value does not differ significantly. The reason is that increasing the $G$ value also increases the overall hardware cost due to an increase in the number of SFQ bitstream generators (see Fig. \ref{fig:overview}). Given our synthesis results, we conclude that keeping the $G$ value small and increasing the $BS$ value is preferred because it provides more flexibility in allocating delayed bitstreams to qubits.
Smaller $G$ values are preferred for \dqmin/ as well, as increasing the $G$ value increases the hardware cost with no significant algorithmic advantage.
The smallest $G$ value or the maximum number of qubits in a group is determined by the area of one SFQ chip; if we cannot fit a group on one chip, we need to use multiple chips and replicate the bitstreams on each chip to avoid long distance communications, which is equivalent to dividing the qubits into multiple groups. Our results show that for 1024-qubit scale, we can fit all the designs with $G=2$ on at most two SFQ chips (one per group), thus we use $G=2$ for 1024-qubit benchmarks in Sec. \ref{sec:algorithms}.

Our results show that even our largest designs can operate within the power budget of typical dilution refrigerators at 4 K stage (i.e., a few watts \cite{mcdermott_full,qarch_hornibrook,horseridge2}), and can be implemented on only a few SFQ chips at 1,024-qubit scale; clock synchronization between the SFQ chips is done using SFQ phase locked loops (PLLs) \cite{sfqpll}. We replicate the 1,024-qubit design in order to scale to larger number of qubits (note that replicating the 1,024-qubit design naturally increases the number of groups). \dqmin/($BS$=$2$) has the lowest hardware cost and highest scalability ($>$42,000 qubits given 10 W power budget \cite{mcdermott_full}). Increasing the $BS$ value in \dqmin/ increases the hardware cost, but also can potentially increase the algorithmic performance
(we see diminishing returns after $BS=4$). The scalability of \dqopt/ is also high, allowing $>$25,000 qubits ($>$17,000 qubits) for $BS=8$ ($BS=16$).

\subsubsection{SFQ storage and Cable count results}
\dqmin/ stores $BS$ bitstreams per group and each bitstream has $\le$300 bits.
\dqopt/ stores one bitstream with $\le$300 bits
per group which is delayed by $BS$ different values at each controller cycle (see Sec. \ref{sec:scheme}). With both designs, for each qubit at each controller cycle, we need enough control bits from room temperature to determine whether to apply one of the $BS$ distinct gates, start/stop performing two-qubit gates, or perform no operation.
For \dqopt/, an additional $BS$ delay values for each group at each cycle are needed; since we have 256 possible delay values, each delay value requires $\log_{2} {256}=8$ bits.

Fig. \ref{fig:area_pow}(c) shows the number of required cables to send \emph{Go}, \emph{Valid}, \emph{Load}, \emph{BS\_sel}, \emph{1q\_sel}, and \emph{2q\_sel} bits from the room temperature in one controller cycle given 10 Gbps return-to-zero (RZ) cables \cite{sfq_logic2}.
We calculate the number of data cables assuming a minimum controller clock period of 9 ns for \dqmin/
and 9 ns + 10.2 ns for \dqopt/ (10.2 ns corresponds to 255 delay cycles) -- we need enough data cables to send one set of control bits from the room temperature within one controller cycle (see Sec. \ref{sec:schemeoverview}). \dqmin/($G$=2,$BS$=2) requires only 39 cables per 1,024 qubits (52.5X less than a microwave-based quantum computer with 2 cables per qubit, 1 drive line and 1 flux line \cite{google_machine1}). \dqopt/ requires just 33 cables per 1,024 qubits in $G=2$, $BS=16$ design.
\dqmin/'s high cable count relative to most \dqopt/ configurations is due to its shorter controller cycle.

\subsection{Algorithmic performance results of \dq/}
\label{sec:algorithms}
In order to study the algorithmic impacts of \dq/, we compile a common set of NISQ benchmarks for each design. The benchmarks chosen are described in \cref{tab:comp:benchmarks}, and  together represent a diverse sample of common circuit formulations.
Benchmark circuits are algorithmically generated and mapped to a $32\times32$ square grid via $\text{SWAP}$-gate insertion using the stochastic transpiler pass packaged with Qiskit Terra~\cite{qiskit}.
Each circuit is then decomposed into CZ and single-qubit gates,
and a crosstalk-aware scheduling pass~\cite{murali2020} is used to sort and group commuting two-qubit gates which can be executed simultaneously without interference.

\begin{table}[t!]
\caption{NISQ benchmark algorithms.}
\centering
\small
\begin{tabular}{rl}
\hline
\textbf{QGAN } & Quantum generative adversarial learning network~\cite{lloyd2018}\\
\textbf{Ising} & Linear Ising model spin chain simulation~\cite{Barends2016} \\
\textbf{BV   } & 1024-bit Bernstein-Varzirani algorithm~\cite{Bernstein1997} \\
\textbf{Add1} & 256-bit ripple-carry adder~\cite{Cuccaro2004} \\
\textbf{Add2} & 256-bit parallel carry-lookahead adder~\cite{Draper2006} \\
\textbf{Sqrt10} & 10-bit square root via Grover search~\cite{JavadiAbhari,Prakash2019,grover}\\
\hline
\label{tab:comp:benchmarks}
\end{tabular}
\vspace{-20pt}
\end{table}

To model frequency variation, each qubit is modeled as an asymmetric transmon with $\sigma=0.2\%$ variability in each of its Josephson energies (sampled from a normal distribution). At our target frequencies, this corresponds to about $\pm6$ MHz fluctuation in oscillation frequency, in keeping with design targets for future superconducting systems \cite{hertzberg2020}.
Hardware variability is considered with the addition of a $\sigma=1\%$ error to the output of each current generator.
As in \cref{sec:simd}, we use these sampled hardware parameters to physically simulate each basis operation on each qubit or qubit pair (similar to prior work \cite{sgrape,mcdermott_kangbo}). We then use the resulting unitary basis operations to decompose each gate in the benchmark circuits. Gate errors in \cref{sec:success-prob} are determined by computing the overlap between the decomposed and target gates.

For \dqopt/, we use a 20.32 ns controller cycle time, comprising 10.12 ns for SFQ bitstreams and 255 delay cycles.
The CZ gate time is 60 ns (determined from the analysis in \cref{sec:simd:2qb}), which expands over three controller cycles.
Single-qubit gates are expanded into at most three $U_{bs}$ pulses (see Sec. \ref{sec:simd:1qb}).
For \dqmin/, single-qubit gate times for the 6.21286 and 4.14238 GHz qubit frequencies are respectively 10.12 ns and 9.00 ns, again with a 60 ns CZ gate time. We decompose single-qubit gates until the approximation error falls below $10^{-4}$, up to a maximum depth of 28 (at which point we find that only about 1\% of gates have errors above $10^{-4}$).
There is no feedback loop in our benchmarks, thus we do not consider the communication latency from outside the fridge.

\begin{figure}[t]
  \centering
  \subfloat[]      {
    \includegraphics[ width=0.9\linewidth]{figs/performance.pdf}
      \vspace{-4pt}
    }
  \begin{center}
  \vspace{-20pt}
  \caption{\dq/ quantum circuit execution time normalized to the Impossible MIMD system.
  }
  \label{fig:comp:depths}
  \end{center}
  \vspace{-25pt}
\end{figure}

\subsubsection{Circuit execution time}
\label{sec:circuitexe}

Fig. \ref{fig:comp:depths} shows the execution time results for \dq/ with 1024 qubits, normalized to an \emph{Impossible MIMD} system which is assumed to have the same gate times as \dq/ (which are also similar to those of recent microwave-based systems \cite{google_machine1,pranav}) but with unlimited parallelism.
We emphasize that the MIMD system is impossible at large scales (see Sec. \ref{sec:back}); we compare our results with the Impossible MIMD system just to quantify the serialization cost of realizing a controller design that is feasible at large scales, and to
give readers a sense of how \dq/ would compare to today's prototypes if they did not have scalability issues.
Both \dqopt/ and \dqmin/ have some overhead in terms of execution time compared to the Impossible MIMD system (\dqopt/ due to serialization and \dqmin/ due to longer gate decompositions).
The performance of \dqopt/ increases by increasing the $BS$ value, as expected, with $BS=16$ providing the best performance.
This difference is minimal for benchmarks without significant parallelism (BV, Add1, Sqrt10).
\revc{For $BS=16$, the execution time is only $\le 2X$ longer than what we would be able to achieve if \dqopt/ could be built with zero quantum gate serialization (i.e., $BS=\infty$).}
In \dqmin/, increasing $BS$ from 2 to 4 reduces the depth of single-qubit gate decompositions by roughly half. However, the benefit is limited beyond $BS=4$ due to the dominance of CZ gate decompositions which do not benefit substantially from the larger single-qubit gate set.
\dqmin/ performs similarly to \dqopt/($BS$=$8$) for the benchmarks with more parallelism (QGAN, Ising, Add2), in which \dqopt/ experiences more gate serialization. For the remaining benchmarks,
\dqmin/'s long gate decomposition leads to worse performance than any \dqopt/ configuration.
Compared to Impossible MIMD system, \dqopt/($BS$=$16$) is 4.7X-9.8X worse in terms of circuit execution time, while \dqmin/($BS$=4) is 11.0X-14.4X worse.

\captionsetup[subfigure]{labelformat=empty}
\begin{figure}[!t]
\begin{center}
\subfloat  [(a)]  {
\includegraphics[width=0.85\linewidth]{figs/single_error.pdf}
}\\ \vspace{-10pt}
\subfloat [(b)]   {
\includegraphics[width=0.85\linewidth]{figs/cz_error.pdf}
} \vspace{-5pt}
\caption{(a) Median single-qubit gate error on \dqopt/ ($BS$=8) and \dqmin/ ($BS$=2) with 1024 qubits (well representative of other configurations); (b) CZ gate error on each qubit pair. Software can map around the outliers using the noise-adaptive mapping techniques \cite{prakash}.}
\vspace{-20pt}
\label{fig:gate-error}
\end{center}
\end{figure}

\subsubsection{Gate/circuit error}
\label{sec:success-prob}

We estimate the overall circuit error due to gate decomposition by taking the product of the errors of each of its gates.
For both designs, typical gate error varies between qubits with different frequency drifts.
\cref{fig:gate-error}(a) shows the median error of single-qubit gates (evaluated across all gates in all benchmarks) for each qubit on \dqopt/($BS$=8) and \dqmin/($BS$=2) (the same conclusions hold for other $BS$ values). We find that \dqopt/ exhibits higher variability between qubits, whereas \dqmin/ is generally more stable but has a small number of especially bad outlier qubits (where the frequency drift brings the nominal T gate very close to the identity, resulting in a poor single-qubit gate set).
Similar to microwave-based systems, we can map around these outlier cases in software using noise-adaptive mapping techniques \cite{prakash}.
The CZ gate error (\cref{fig:gate-error}(b)) is driven both by the decomposition of CZ into $U_{qq}$ and single-qubit gates, and by the error with which we can decompose those single-qubit gates on each architecture. The CZ error is $>$0.002 for 3\% and 7\% of qubit pairs in \dqmin/ and \dqopt/, respectively. Note that the CZ error would be $>$0.002 for 84\% of qubit pairs if we did not use our software calibration techniques.
Our results show that with software calibration \dq/ can achieve similar gate error to that of hardware-calibrated microwave-based gates \cite{sgrape}.

\subsection{Cryo-CMOS based quantum controllers} Due to maturity of CMOS technology, Cryo-CMOS is an attractive technology to do computation at the 4 K stage of the fridge.
In \cite{horseridge2}, single-qubit gate operation using a Cryo-CMOS controller prototype is demonstrated, which is done by generating microwave control signals inside the fridge using the pulse information that is stored in on-chip SRAMs. The prototype presented in \cite{horseridge2}
can scale to $>$800 qubits given 12 mW/qubit power consumption reported in the paper and 10 W power budget \cite{mcdermott_full}. In comparison, SFQ logic can potentially maximize the scalability of quantum controllers ($>$42,000 qubits in our SIMD design) due to its very low power consumption. Note that
SIMD can potentially increase the scalability of today's Cryo-CMOS prototypes as well, which we see as important future work (see Sec. \ref{sec:conclusion}).

\subsection{SFQ-based quantum gates and controllers}
In \cite{mcdermott_fab}, coherent control of a qubit using SFQ pulse trains is demonstrated using a DC/SFQ converter that is fabricated on the qubit chip; the experimental results in the paper show the feasibility of performing quantum gates using SFQ. In \cite{mcdermott_kangbo}, the authors propose a method to find SFQ bitstreams for qubits with different frequencies using one single SFQ clock. A genetic algorithm is used in \cite{sfq_genetic} as an approach to find efficient SFQ
bitstreams to reduce leakage errors (i.e., unwanted energy transfer to states other than $\ket{0}$ and $\ket{1}$) and gate time. Reinforcement learning is another approach that has been utilized to find efficient SFQ bitstreams to perform quantum gates \cite{alphazero}. In \cite{mcdermott_full}, the authors outline a vision to perform fault tolerant quantum computing that relies on repeated streaming of stored SFQ bitstreams, and present a simple estimation of power by adding the power of SFQ registers. In contrast to these works, \dq/ is the first system-level design of a scalable NISQ-friendly SFQ-based controller.

\subsection{SFQ-based accelerators}
SFQ has been utilized to design hardware accelerators thanks to its ultra-high speed. In \cite{nisq+}, the authors propose an SFQ-based error decoder to accelerate quantum error correction. In \cite{supernpu}, the authors present an ultra-fast SFQ-based neural processing unit. In contrast to these works, our focus is on designing a scalable SFQ-based controller rather than accelerating a task.
\subsection{Calibrating single-qubit gates}
\label{sec:simd:1qb}

The key idea behind gate calibration on \dq/ is that these frequency-dependent operations still constitute universal gate sets for single-qubit computation \cite{kitaev1997}. We can therefore account for frequency drifts and hardware variation on each qubit by decomposing single-qubit gates on each qubit using the unique set of basis operations resulting from shared SFQ bitstreams.
For both \dqopt/ and \dqmin/, the single-qubit calibration procedure then consists of four steps:
(1) find SFQ bitstreams implementing a desired set of basis gates with high fidelity on qubits with no frequency variation,
(2) characterize each qubit's actual oscillation frequency using experimental measurements \cite{mcdermott_full},
(3) use the learned bitstreams and measured frequencies to determine the actual basis operations implemented on each qubit by the shared bitstreams, and
(4) compile quantum circuits using the actual single-qubit basis operations determined for each qubit.
The (classical) complexity of these steps scales linearly with number of qubits and circuit size.

For steps (1) and (3) we employ single-qubit physical simulations of the expected single-qubit unitary evolution $U_{bs}$ produced by an SFQ bitstream on transmon qubits (as done in \cite{mcdermott_kangbo}).
To ensure we are fully accounting for state leakage, we model transmons using six energy levels, and then compute single-qubit gate fidelities by projecting the resulting evolution back into the two-level subspace (causing any leakage to be captured as additional error \cite{nufidelity}).

For \dqopt/, calibrating gate decomposition means finding a new set of delay intervals such that the target operation is approximated by a sequence $Rz(\phi_{L})U_{bs}...Rz(\phi_{1})U_{bs}Rz(\phi_0)$ (where the final $Rz(\phi_{L})$ is absorbed into a subsequent gate).
We choose sets of delays holistically for each gate, numerically searching for the best combination of the available delays to implement that gate.
We find that $L\le2$ is sufficient for most gates, but a subset of gates nearing $\pi$ rotations around the x or y axis (e.g., Pauli X and Y operations) need $L=3$ to obtain high fidelity on qubits with the most significant drift (whereas in the ideal case (i.e., $U_{bs}=\ry(\frac{\pi}{2})$), $L\le2$ is enough for all single-qubit gates).

\begin{table}[!bt]
\caption{Optimal parking frequencies and drift tolerance for $Rz(\phi)$ gates with $\le10^{-4}$ error for $N=255$.}
\centering
\small
\begin{tabular}{|c|c|}
\hline
    Parking frequency (GHz) & Drift (GHz) for error $\le10^{-4}$ \\
\hline
     6.21286 & $\pm 0.01282$ \\

     5.02978 & $\pm 0.01049$ \\

     4.14238 & $\pm 0.00820$ \\
\hline
\end{tabular}
\label{tab:opt-freqs}
\vspace{-10pt}
\end{table}

Two factors affect performance of the \dqopt/ decomposition.
First, the set of available $Rz(\phi)$ rotations
is highly dependent on qubit frequency, which determines how well the $N+1$ possible delay values cover the unit circle. In the ideal case, the $N+1$ phases are equally spaced around the unit circle, and any $Rz(\phi)$ can be approximated to within $\pi/(N+1)$ radians; in this case we find that $N=255$ is sufficient for error $\epsilon\le0.25\cdot10^{-4}$.
We choose target frequencies with the highest tolerance for variation, as measured by the width of the interval in which any $\phi$ can be approximated with $<10^{-4}$ error using one of the available delays. These optimal parking frequencies and their drift tolerance are shown for $N=255$ in \cref{tab:opt-freqs}.
Second, frequency variations can limit SIMD scheduling.
For example, if a circuit calls for the same gate to be applied to many qubits, these may still require unique delay values when the decomposition of that gate differs for each qubit.
However, we can increase parallelism by allowing a small error margin when choosing delay values: often, multiple sets of delays will approximate the same operation with nearly equal error, so we can choose the one with lowest cost in terms of serialization.

For \dqmin/, we decompose arbitrary single-qubit gates into sequences of discrete, qubit-specific basis operations.
We use a brute-force search algorithm to find the optimal decomposition of single-qubit gates for each qubit, working with the full six-level representation of the unitary basis operations so that the decomposition accounts for and mitigates leakage resulting from each basis operation.

\subsection{Calibrating two-qubit gates}
\label{sec:simd:2qb}

The implementation of CZ gates using flux-tunable transmons requires the shape and duration of each current pulse to be carefully calibrated to the precise qubit frequencies and hardware parameters.
On a small system with MIMD control, these pulses can be individually calibrated for each pair of coupled qubits to account for variation and drift.
Without this fine-grained control, we are instead left with a unique 2-qubit operation $U_{qq}$ for each coupled pair of qubits.
Here, we argue that we can instead compose CZ gates for each pair of qubits in \dq/ using pair-specific sequences of $U_{qq}$ operations and single-qubit gates, again relegating calibration to software.

We can compute the unitary evolution $U_{qq}$ for a pair of qubits using physical simulations of the empirical current waveform described in \cref{sec:scheme:2qubit}.
Starting with the nominal pre-drift frequencies of 6.21286 and 4.14238 GHz from \cref{tab:opt-freqs}, we vary each qubit's frequency and compare the resulting $U_{qq}$ to the target CZ operation.
We compute unitary evolution by numerically integrating the Schr\"odinger equation using well-understood Hamiltonian models of pairs of capacitively-coupled flux-tunable asymmetric transmons \cite{quantum_eng}.
We assume that each transmon has an anharmonicity of 250 MHz,
and the capacitive coupling strength is 10 MHz.

In \cref{fig:cz:freq-shift}(a), we show the expected minimum error when implementing a CZ gate using a single $U_{qq}$ pulse as a function of each qubit's drift, allowing for arbitrary single-qubit gates before and after the pulse.
At the ideal qubit frequencies, we find an expected error of $\epsilon=3\cdot10^{-4}$.
This error grows rapidly as the frequency difference between qubits drifts.
In \cref{fig:cz:freq-shift}(b) and (c), we show the gate error after compiling CZ gates into sequences of 2 or 3 $U_{qq}$ operations and intermediary single-qubit gates, similar to the ``echo'' sequences described in \cite{echo1,echo2} but with single-qubit gates obtained via numerical optimization.
Assuming ideal single-qubit gates, we find that 3 $U_{qq}$ operations are sufficient to achieve $\epsilon\le10^{-4}$ over a wide range of frequencies.
In \cref{sec:success-prob}, we report empirical gate errors after single-qubit gates are decomposed for either \dqopt/ or \dqmin/.

\begin{figure}[!t]
  \centering
    \includegraphics[ width=\linewidth]{figs/cz-drift-error-2.png}
    \\\vspace{-2pt}
    \;\;(a)\qquad\qquad\;\quad(b)\qquad\qquad\quad(c)\qquad
  \caption{CZ gate error as a function of frequency drift, assuming 1, 2, or 3 $U_{qq}$ operations and ideal single-qubit gates.
  }
  \label{fig:cz:freq-shift}
\end{figure}

redpajama_set_name: RedPajamaArXiv


The chunky, fully featured 24in widescreen HP W2408H makes itself as future-proof as possible, incorporating an HDMI input alongside one analogue and four USB 2.0 ports.
A contrast ratio of up to 3,000:1 impresses, as does the HP W2408H's better-than-average 400cd/m2 screen brightness and 16.8 million colours, even if we hoped for a better response rate than the standard 5ms.
Still, boasting a similar robust metal stand to the HP w1907V, the HP W2408H can be adjusted for height, tilted back and forth (up to 25 degrees), pivoted left and right and even rotated through 90 degrees for portrait-format viewing.
Mixing a shiny black screen surround with silver buttons and stand, the two-tone HP W2408H is an attractive option for those looking for something to blend seamlessly with their PC.
Operating the HP W2408H is plug-and-play from the off. The HP W2408H performs an automatic adjustment, while its menu options are clearly labelled. As with the w1907V, a Quick View mode lets you swap between presets for viewing movies, photos, gaming and text, along with a fifth custom setting.
The HP W2408H is therefore user-friendly and intuitive to operate.
The manufacturer has talked up the w2408H's capacity to produce vivid colours, and we're not inclined to disagree. It turns in an impressively rich and sharp display, with deep blacks that provide an added degree of realism. Movies look terrific, with fast-moving action sequences handled effortlessly.
If you routinely watch a lot of films, view digital photos and play games on your PC, the HP W2408H could be the display for you. It provides masses of screen space and an impressively clear picture for all three tasks, and you can quite happily leave multiple applications open on your desktop simultaneously. Now all you have to do is cope with the price tag.
The HP W2408H may be big, but it's clever too, providing beautiful pictures and future-proof features. We want one.


text:
The Boy Scouts of America (BSA) has worked to keep the membership fee as low as possible. As you know, costs continue to rise, and the annual fee must be increased to address the fiscal realities we face to deliver a safe and quality Scouting program.
To ensure we have the resources to fulfill the promise of Scouting, the following national membership fee structure will take effect August 1, 2022.
$75 for Cub Scouts, Scouts BSA, Venturing and Sea Scouts participants
$45 for Exploring participants
$30 for council-paid memberships
$45 for all adult volunteers (includes cost of background check)
$100 for a unit charter/affiliation fee
$25 one-time joining fee for new program participants in Cub Scouts, Scouts BSA, Venturing and Sea Scouts (Not pro-rated)
$15 for Scout Life magazine; this is the first price increase since 2005
The national membership fee helps cover the cost of essential services, including program resources, liability insurance for those participating in approved Scouting activities, criminal background checks, youth protection, and the development of intellectual property for national, council, and unit programs. As we move forward, we will continue to look at the membership fee structure and how we deliver the Scouting program for future generations.
See an infographic explaining these updates.
Q: How much of the National Fee stays with the Central Georgia Council?
A: None of it – 100% of the money your unit turns in for new members and recharter goes directly to the National office. In fact, though the National office allows it, the Central Georgia Council has never chosen to add on its own fees in addition to the National ones. Our staff and outstanding teams of volunteers raise necessary funds through the generous contributions of our community via donations, grants, and fundraising all year long. It is their efforts and yours – through selling Popocorn, Camp Cards, and your unit's participation in Friends of Scouting campaigns – that make Scouting the most affordable youth activity in our area.
Q: Why are the fees increasing?
A: The national annual membership fee is increasing by $6, about 50 cents per month because the costs associated with Scouting, including the cost of liability insurance, continue to increase and the organization is not able to subsidize the increased costs as it had in the past.
Q: When will this increase take effect?
A: The updated membership fees will take effect August 1, 2021, for new members in the 2021-2022 program year.
Q Is Scouting still a good value?
A: Absolutely! While most extracurricular activities are seasonal, Scouting is a year-round program that remains one of the most valuable investments we can make to support young men and women today so they can become the leaders we will turn to tomorrow. For most of our participants, the new national membership fee amounts to $6.00 a month, which is an enormous value when you consider that many seasonal extracurricular activities often start at $100 for programs that last a few weeks.
Q: Does the fee increase apply to the council-paid memberships of the Scoutreach program?
A: Council-paid memberships will not change for youth members of Scoutreach, the in-school and after-school programs designed for low-income communities.

redpajama_set_name: RedPajamaCommonCrawl


Barbara Michel, author of 20 novels, is a graduate of the British-American School of Writing. She is also a certified medical transcriptionist. She spoken and taught at writers' workshops and conferences and does critiquing of manuscripts.
Several of her novels have won first place awards at writers' workshops and conferences. Her Colorado Blaze entry won a national award in the Writers' Digest 2006 novel contest.
Michel has studied various aspects of the Bible and Christian theology. While her husband, Rev. Gerald Michel, served as a United Methodist Pastor, she directed youth and young adult gospel-singing witness groups, led services in churches of various denominations and delivered the message. Many dedicated or rededicated their lives to Christ in those services. She also served as a Sunday School teacher, led Bible study and prayer meetings, directed choirs, and offered counsel to many who sought her advice. As a soprano soloist, she gave gospel concerts.
For a few years, she and her husband broadcast a Biblical teaching and gospel singing radio program. She wrote and edited articles for the Grace Ministries publication.


Have you ever listened to the podcast Entrepreneur on Fire? In case you haven't, John Lee Dumas interviews successful entrepreneurs and one of the questions he asks is what their biggest weakness is. To my surprise, many of them say that they're perfectionist tendencies are their biggest weakness. For one, thank goodness I'm not the only one who struggles with this! And, for two, there is hope for us perfectionists!


text:
SPECTRE (Sam Mendes, 2015) - A SPOILER-FREE REVIEW
Daniel Craig, Christoph Waltz, Lea Seydoux, Ralph Fiennes, Andrew Scott, Jesper Christensen, Monica Bellucci, Ben Whishaw, Naomie Harris, Dave Bautista, Rory Kinnear, Stephanie Sigman. 148 minutes.
The previous James Bond film, 2012's SKYFALL, grossed over a billion dollars, and even adjusted for inflation, stands as the most commercially successful film of the series. It also won two Oscars (one of them for Adele's title song), and is the most critically acclaimed of all the films. The producers, Michael G. Wilson and Barbara Broccoli, waited for the film's director, Sam Mendes, to finish his theatre commitments so that he could return for the next film. The expectations are high for Bond 24 aka SPECTRE.
In the precredits sequence, which includes a masterful, thrilling tracking shot akin to TOUCH OF EVIL (1958), we see Bond tracking down and attempting to kill a man in Mexico City, during the Day of the Dead celebrations. Bond almost demolishes the city on his mission but comes into possession of a ring that will set him on a course to Rome, Austria and Morocco and bring him back to London. It will also complete the circle that started in CASINO ROYALE (2006) and force him to deal with his past and his future. At the same time, his superior M battles a merging of MI6 and MI5 and the creation of a global intelligence sharing network that will also see the end of the 00 section.
The film marks Daniel Craig's first 'traditional' Bond film. After the traumatic events of SKYFALL, Bond is now the 007 we previously knew and loved. He's at ease with himself, and the clothes, the witty lines, the womanising, and the gadgets are all present and correct. Those that complained the Bond of the previous Craig films was no kind of hero at all will not feel that way here. He's also noticeably more human after the events of the previous films. The heroine even describes him as 'a good man'. Craig gives one of the most iconic Bond performances of the series, and dominates the part with a force not seen since Connery in GOLDFINGER (1964) or THUNDERBALL (1965). One of the most pleasing elements of the film are the little humorous character moments Craig affords us – the smile he gives a bad guy before throwing him over a balcony to his death, for example; his happiness at being behind the wheel of an Aston Martin DB10, and his playful tone whilst being interviewed by Lea Seydoux. The tone of the film recalls that controlled tone of the first four Bond films and ON HER MAJESTY'S SECRET SERVICE (1969).
SPECTRE is still very much a Sam Mendes Bond film, though, and very much the sequel to SKYFALL. Mendes imbues the film with the eerie sense of dread from the final act of that film, and the relationships between Bond and his new team – Ralph Fiennes as M, Ben Whishaw as Q, and Naomie Harris as Moneypenny, are pleasingly and entertainingly developed from the last film. Mendes sets the end of the film once again in the UK, the story once again involves Bond facing his past, and Bond is once again having to fight his own obsolescence. Mendes continues to explore the need for the human touch (field agents) in surveillance and intelligence gathering, and here he is also interested in the repercussions of the government surveilling its own public and the open sharing of intelligence between nations. CASINO ROYALE was a post-911 thriller, SPECTRE is a post-Snowden thriller.
Mendes also brings a refreshing romantic feel to the film. SPECTRE sees a slowly burgeoning romance between Bond and the psychologist Dr. Madeleine Swann, played by Lea Seydoux. Their relationship has echoes of a previous one Bond has had. Seydoux is captivating in the film. She has a kind of beauty that never hits home and manages to never look the same in each scene. The actress manages to create a three dimensional character. Madeleine is a woman tough but vulnerable and scarred but not beaten by the past. She offers Bond another chance for redemption.
SKYFALL, following the death of Judi Dench's M, saw the appointment of Ralph Fiennes as her replacement. Fiennes has some great moments in the film, crossing swords with C (Andrew Scott). His new dynamic with Bond is compelling and fun. The relationship between Bond and Moneypenny, played the fine actress Naomie Harris, is now more flirtatious but also deeper. Rory Kinnear as Bill Tanner has unfortunately not yet been allowed to shine in the role. Andrew Scott as 'C', a bureaucrat looking to end the days of the 00 section and merge MI6 with MI5, is very good at projecting the arrogant, unknowable nature of his character.
Ben Whishaw as 'Q' is simply wonderful. He's as lovable as Desmond Llewelyn but in unique ways, and audiences will look forward to his future appearances as much as they did Llewelyn's. 'Q' actually has the funniest line in the movie – and at Bond's expense. Whishaw and Craig (in their fifth film together) have great chemistry together, and have a much closer 'bond' than they did in the previous film.
Stephanie Sigman and Monica Bellucci make an impression with their beauty and charisma, but unfortunately do not have much screen time. Bellucci, though, does appear in one of the most stunningly realised scenes of the picture. Jesper Christensen returns as Mr. White from CASINO ROYALE and QUANTUM OF SOLACE, and is important in moving the plot forward. His reunion with Bond is memorable, and contains some unexpected elements.
Christoph Waltz as the villain, Oberhauser, is the most fascinating and effective of the Craig era. Waltz is an actor who is always amazingly precise and he curiously chooses to underplay the role. The result is disturbing and scary, and all the more so because Oberhauser's psychosis could go so easily unnoticed in plain sight. His method of torturing Bond is the film is the first acknowledged use of material from a Bond continuation novel, and is truly unsettling.
The film, actually the longest of the series at 148 minutes, is pacier than SKYFALL. It is also more epic in its locations, and its travelogue quality is extremely aesthetically pleasing. Mendes and cinematographer Hoyte Van Hoytema capture the character and atmosphere of the locations in careful detail. Mexico is grandiose and alive. Morocco has a romantic, old world feel. One shot in the desert recalls Omar Sharif's entrance in LAWRENCE OF ARABIA (1962). A master shot of the train making its way through the desert is hugely memorable for its desolate, romantic beauty. Rome is appropriately stately and historical, and fits well with the ghostly connections of the story. It's a city of deadly secrets, and it's reflected in the architecture. When Bond first sees Oberhauser up close, there is a nod to Kubrick and EYES WIDE SHUT (1999). The scene itself is a modern updating of an iconic scene from THUNDERBALL (1965). Austria is beautifully white and mountainous, with Madeleine's clinic remote and open glass. But death and danger can easily find its way there. There are many reminders of previous Bond films, some intentional, some probably not, although LIVE AND LET DIE (1973) and FROM RUSSIA WITH LOVE (1963) have already been acknowledged as being homaged by Mendes and Craig. Certainly the echoes to previous Craig films are intentional and deepen the drive and emotional power of the story, and complete the arc in an emotionally satisfying fashion.
Mendes allows the film to breathe, and actually, the most satisfying section of the movie is actually set in a Tangier hotel room where Bond and Madeleine start to understand each other and face their similar pasts before facing Oberhauser. The sadness on Seydoux's face in one scene and Thomas Newman's empathetic scoring are quite touching. It feels like an interlude but it's actually the soul of the movie. The film takes the time to allow Madeleine to go through a grieving process, rare in a Bond film or an action film.
The action scenes flow naturally out of the story, and involve Bond using resources at hand to outwit his enemies. As in FROM RUSSIA WITH LOVE, for example, Bond may have a gadget, but he has to outwit his enemy in order to use it. The action scenes are traditionally edited and easy to follow. The helicopter fight in the precredits sequence is thrillingly constructed and is exciting. A car chase in Rome (akin to an idea used in the script to the unmade third Dalton film) is a duel of speed between two high performance cars in which Bond cannot rely on the car's gadgets to work. A chase between Bond's snowplane and the enemies' cars is inventively put together and full of adrenaline. It's interesting to see Bond thinking his way through beating his enemies in the scene.
The highlight action scene of the film is a brutal, brilliantly choreographed and filmed fight scene aboard a train, between Bond and Dave Bautista's Mr. Hinx. The scene is quite simply a classic. Hinx also has a memorable entrance in the film, and is a welcome return to the seemingly indestructible, mute henchmen of the series like Jaws or Oddjob.
Dennis Gassner's third work for the series is once again excellent, typically echoing the psychology of his characters. Note Bond's sparsely furnished apartment. This is a man who exists to be moving forward and not staying still, and it's reflected in the production design. Jany Temime's costume work is elegantly and romantically old school at times, and super modern and classy at others. Lee Smith, Christopher Nolan's favoured editor, is adept at maintaining pace without sacrificing visual and narrative clarity. He's also talented at balancing concurrent action involving different characters. Thomas Newman's score emphasises the film's links to SKYFALL by reprising some of its cues, and his choices emphasise the mystery, dread and immediacy of the story, and the atmosphere, history and feel of the locations. The soundtrack lacks memorable melodies but is perfectly in sync with the film. Sam Smith's theme song Writing's on the Wall is a mid-tempo Basseyesque love song that improves with time after one becomes more attuned to its unconventional structure. It oddly fits Daniel Kleinman's surreal, nightmarish main titles very well.
Mendes and his writers John Logan, Robert Wade and Neal Purvis, and Jez Butterworth, have fashioned an ambitious Bond screenplay that follows logically on from SKYFALL, completes the arc begun with CASINO ROYALE, achieves a more epic, traditional, and fun quality, and explores new themes. It's a considerable achievement.
The film is not perfect. As with SKYFALL, sometimes the logic is arguably lacking. The revelations in the film are hard to swallow upon reflection but they ring emotionally true. The film could perhaps have been tighter. A side effect of the film keeping a balanced tone throughout is that the action is never as propulsively exciting as CASINO ROYALE or QUANTUM OF SOLACE. The last act of the film is good, but does not live up to the rest of the film because it relies on familiar action tropes. That said, it's a satisfying ending emotionally, and Bond's final line is unexpectedly moving and upbeat, reminding one of the increased emotional connection the Craig era has brought to the series.
Subsequent viewings bring up niggling questions like 'Why do we never see people actually falling to their deaths? Where did the other passengers on the train suddenly disappear to in the Bond and Madeleine dinner scene? How exactly did the villain achieve his power base?' Bond never really seems to be in peril, and escapes very easily throughout the picture. A shootout at the villain's compound is a wasted opportunity to see a physically and mentally impaired Bond in danger of not achieving his escape. But such a critical eye could be applied to even the most classic of Bond movies. And this is one of the best.
SPECTRE is an artistically successful, hugely enjoyable thrill ride of a movie, and the most satisfying Bond film since CASINO ROYALE. Craig delivers one of the most iconic, relaxed performances of the series. The filmmaking is thrilling, beautiful and atmospheric. The relationships between Bond and M, Q and Moneypenny are each unique, entertaining and compelling to watch. Lea Seydoux is one of the most three-dimensional and beautifiul women of the series. Christoph Waltz and Dave Bautista are brilliant, memorable villains. The storyline is topical and thought-provoking, and Bond's journey from CASINO ROYALE feels complete. It leaves the series in an exciting place, and what is even more exciting is that we have never really been able to predict the nature of each succesive Craig installment. We have the most fully rounded, multi-faceted Bond actor yet, and the opportunities for films as fun as they are deep is heartening. Roll on Bond 25.
Oh, and if the final scene doesn't leave you with a smile on your face? You're not a Bond fan!
Copyright © Paul Rowlands, 2015. All rights reserved.
Labels: Review: SPECTRE


Additionally, the American Bus Association has named the Custer State Park Buffalo Roundup as the top event in the U.S. on their list of the Top 100 Events in North America for 2015.
Frommer's is a travel guidebook series that was founded in 1957, and also includes the website Frommers.com. For a full list of the Frommer's "Best Places to Go in 2015," click here.
The American Bus Association is a trade association for motorcoach operators and tour companies in the U.S. and Canada. For more information regarding the American Bus Association's Top 100 Events in North America, click here.


Join the Milano School for Policy, Management, and Environment and learn how to identify good sources, solid facts, and verifiable information.
Being a better news consumer in the digital age is critical! As everyone struggles to deal with information overload and the difficulty in determining the authenticity of news reports, it's more important than ever to learn critical thinking skills that can help us find trustworthy information. This workshop aims to teach us how to identify fact from fiction, news from opnion, and how these skills are important to a democratic society.
On Tuesday, April 16th, join us for a hands-on workshop led by Stony Brook University's Center for News Literacy. Learn how to fight fake news, and why becoming a more discerning news consumer can change individual lives and the life of the country.
*laptops and smart phones are encouraged for this workshop!


EJB invocations from a remote server instance - WildFly 10 - Project Documentation Editor for your Wiki!
WildFly 8 is secure by default. What this means is that no communication can happen with an WildFly instance from a remote client (irrespective of whether it is a standalone client or another server instance) without passing the appropriate credentials. Remember that in this example, our "client server" will be communicating with the "destination server". So in order to allow this communication to happen successfully, we'll have to configure user credentials which we will be using during this communication. So let's start with the necessary configurations for this.
The above command creates a remote-outbound-connection, named "remote-ejb-connection" (we can name it anything), in the remoting subsystem and uses the previously created "remote-ejb" outbound-socket-binding (notice the outbound-socket-binding-ref in that command) with the http-remoting protocol. Furthermore, we also set the security-realm attribute to point to the security-realm that we created in the previous step. Also notice that we have set the username attribute to use the user name who is allowed to communicate with the destination server.
Agree with fan kam thong but i dont see an answer for 2 years ago.
i need to lookup a targeted ejb receiver, how can i do that?
You should ask such questions here https://community.jboss.org/en/jbossas7.
with <subsystem xmlns="urn:jboss:domain:remoting:3.0"> , and replace <jboss-ejb-client xmlns="urn:jboss:ejb-client:1.0">with <jboss-ejb-client xmlns="urn:jboss:ejb-client:1.2">.
In my solution i needed to have an JBoss EAP 6.3 client call a EJB deployed in the JBoss EAP 7.0 (Wildfly 10).
I reiterate a warning from the developer Márcio Dantas for Jboss AS 7, that the communication only works when there is a boot time handshake message in the JBoss ejb client side.


Hi, I'm Erik. You can read more about me on my about page, if you're so inclined. I'm a career-long programmer, sometimes manager/executive, erstwhile consultant, and current hermit.
These days, a lot of the content I make for this site is more career-focused. This includes advice for advancing in the corporate world but also a lot of advice for going off on your own. This page, however, isn't about that sort of advice. (If you'd rather see a welcome page for that, check it out here).
If you're here, you are, no doubt, coming from one of my technically focused articles. I've been a technologist professionally for more than 15 years now, learning more languages, frameworks, and patterns than I can remember off the top. On this blog, you'll find a lot of .NET stuff, some Java stuff, and a ton of articles focused on architecture, static analysis, patterns, and test driven development (TDD).
It's hard to neatly summarize this body of content. So for people new to my site, I've pulled together a quick, curated list of things I've done that you might want to check out.
For a quick feel, you can check out services I offer and products I offer. But here's a more focused list.
I did a whopping 62-part video series on using TDD to build a chess moves engine. It's also a Youtube playlist.
I've done four Pluralsight courses that you can find here, at my author page. These include courses on TDD, static analysis, and home automation.
On top of the TDD course, I've also written a book about unit testing (with or without TDD).
Here I am on Github. All of the instructional stuff I do is public.
I write a weekly column for NDepend, a .NET static analysis tool.
I do the same for SubMain, who makes an automated .NET code review tool.
If you like this stuff, I'd suggest subscribing to my RSS feed. Every week, I do a digest post that summarizes all of the techie stuff I write, everywhere on the vast digital plain of the internet.


text:
Mass Walk-Out at UN Climate Talks Protests Lack of Progress
Laura Beans
Nov. 21, 2013 03:46PM EST Climate
By Paul Brown
It is first time in 19 years of tortuous annual negotiations over targets and timetables for saving the Earth's climate from overheating that the non-governmental organizations have felt sufficiently frustrated to take such a step.
Organizations frustrated with the pace and progress of the UN climate talks in Warsaw, Poland, staged a walk-out today. Photo credit: Czarek Sokolowski /AP
Many of the 800 people involved are members of national delegations and are an important part of pushing the negotiations to a successful conclusion.
The groups concerned, some of them—like ActionAid, Oxfam and World Wildlife Fund—normally considered moderate, issued a joint statement saying that the climate talks here were set to "achieve virtually nothing."
The statement said:
The actions of many rich countries here in Warsaw are directly undermining the Climate Change Convention itself, which is an important multilateral process that must succeed if we are to fix the global climate crisis.
The Warsaw Conference has put the interests of dirty energy industries over that of global citizens—with a Coal & Climate Summit being held in conjunction; corporate sponsorship from big polluters plastered all over the venue; and a presidency (Poland) that is beholden to the coal and fracking industry.
When Japan announced that it was following Canada and backtracking on emission cuts commitments previously made, and Australia gave multiple signals that it was utterly unwilling to take the UN climate process seriously, the integrity of the talks was further jeopardized.
Many individual statements from experienced campaigners underlined the lack of progress. Susann Scherbarth, for Friends of the Earth Europe, said: "We are walking out in frustration and disappointment, enough is enough."
However, half the NGOs decided to stay in the talks and continued lobbying for progress. Several said they understood the sentiments of those outside but felt that there was still hope.
Nocturnal Negotiations
The negotiations to try to rescue something from the talks were set to continue through a second night. Delegates are trying to negotiate the skeleton of an agreement whose aim is to bind the 194 participating nations into a new deal to help prevent the climate overheating. It is due to be signed in Paris in 2015. Pledges of emission cuts and of timetables to achieve them are not expected at this summit, but some time next year.
The main sticking point at Warsaw has been the lack of funds to help developing countries adapt to climate change and repair the losses caused by sea level rise and extreme climate events. There is one day left for formal negotiations, but in fact they are expected to run into Saturday to try to reach a deal.
Any countries or delegates who might have been relieved at the loss of campaigners from the conference can expect to see them back again at the next conference in Lima, the Peruvian capital, in 2014. In the meantime the NGOs said they would concentrate on raising public awareness of the threat to the planet and would organize as many civil protests as possible.
The groups are: ActionAid, the Bolivian Platform of Climate Change, Construyendo Puentes (Latin America), Friends of the Earth (Europe), Greenpeace, Ibon International, the International Trade Union Confederation, LDC Watch, the Pan-African Climate Justice Alliance, the Peoples' Movement on Climate Change (Philippines), Oxfam International and World Wildlife Fund.
Paul Brown, Climate News Network editor, is in Warsaw, host of the United Nations climate talks—the 19th Conference of the Parties (COP 19) of the UN Framework Convention on Climate Change.
Visit EcoWatch's CLIMATE CHANGE page for more related news on this topic.
climate change featured news


text:
Student Services Blog
Jan 27, 2017 / News
SAFS in the News: Climate change prompts Alaska fish to change breeding behavior
SAFS post-doc Rachel Hovel and SAFS professor Tom Quinn are featured in UW Today:
'One of Alaska's most abundant freshwater fish species is altering its breeding patterns in response to climate change. This could impact the ecology of northern lakes, which already acutely feel the effects of a changing climate.
That's the main finding of a recent University of Washington study published in Global Change Biology that analyzed reproductive patterns of three-spine stickleback fish over half a century in Alaska's Bristol Bay region. The data show that stickleback breed earlier and more often each season in response to earlier spring ice breakup and longer ice-free summers.
While several papers have speculated that conditions brought on by a warming climate may allow animals to breed more often in a single year, this has only been empirically shown in insects. This study is the first to document multiple breeding cycles for fish in a single season due to climate change, said lead author Rachel Hovel, a postdoctoral researcher in the UW's School of Aquatic and Fishery Sciences.'


Fried Oysters Wrapped In Bacon recipe and other easy bread recipes updated by our cooking food network top chefs. Fill Free to download and share with your friends and family.
In a 1 quart saucepan, on a medium flame, poach oysters in oyster liquor with bay leaf and Worchestershire (about 2 minutes, until the edges of the oysters curl). Remove oysters from liquor and set aside. Discard liquor. Cut bacon strips in thirds. Wrap each oyster with bacon and fasten with a toothpick. Roll in flour, dip in eggs, and then roll in bread crumbs. Heat oil in a 9 inch skillet. When oil smokes, reduce heat and fry oysters for 5 minutes. Drain on paper bag and serve immediately. Yields 12 oysters.


text:
Service : World » Americas
Pompeo addresses anti-Iran summit associated with terror groups, blames Iran for terrorism
US Secretary of State Mike Pompeo has addressed a gathering of notorious anti-Iran terrorist and separatist groups in a bid to urge action against Iranian "aggression."
RNA - Speaking at the United Against Nuclear Iran (UANI) 2019 summit in New York on Wednesday, Pompeo called on world countries to stand with the US alongside Israel, announcing new sanctions against Iran and blaming Tehran for backing "terrorist groups".
The summit, which was being held on the sidelines of the 74th session of the United Nations General Assembly in New York, is reported to be dominated by terrorist groups such as the Mojahedin-e Khalq Organization (MKO).
Earlier this week, Iranian Foreign Ministry Spokesman Abbas Mousavi described the UANI as an American "cover organization" closely tied to terror groups, adding that Tehran would consider blacklisting the UANI as a terrorist group.
Senior official from Saudi Arabia, Israel and Bahrain also took part in the anti-Iran meeting.
Speaking at the summit on Wednesday, Saudi Minister of State for Foreign Affairs Adel al-Jubeir accused Iran of terrorism and of being behind the recent Yemeni-claimed attack on Saudi Arabia's oil facilities, an allegation firmly rejected by Tehran.
Jubeir said that Riyadh was considering political and military options in response to the attacks.
Saudi Arabia has forged close links with separatist and terrorist groups seeking to operate in Iran, most notably the MKO. In May 2017, Saudi Arabia, under Crown Prince Mohammed bin Salman, pledged to take "the battle" to Iran.
Washington, which had labeled the MKO as a terror organization until dropping the designation in 2012, has also considerably stepped up support for the group and other like-minded terror organization targeting Iran.
The increasingly confrontational approach against Tehran by Tel Aviv, Riyadh and Washington has, nonetheless, raised concerns about a probable disastrous military quagmire in the region.
On Wednesday, numerous peace activists attempted to interrupt the UNIA summit in protest against Washington's provocative campaign of "maximum pressure" against Iran.
Code Pink, a grassroots anti-war NGO based in the US, reported a number of the demos, showing protesters at times being violently dragged away from the event.
Tags: Pompeo Iran US
Short Link rasanews.ir/201sMg
Human Rights Watch, rights group condemn Bahrain's denial of medical care to prisoners
Bahrain's Wefaq asks women heads of state to support jailed activists
US Impeachment Hearings Could Start Next Week
Trump authorizes travel ban on top Iranian officials, their families
Trump exposed to 'national security risks' while seeking Ukraine's help
US minority students concentrated in high-poverty schools: Study
Biden leads 2020 Democratic rivals in tight race
No One Is Above Law:
Pelosi Announces Launch of Formal Impeachment Inquiry into Trump
FBI arrests far-right US soldier plotting to bomb news network
Protesters Demand Justice for Khashoggi Outside MbS Charity Event in US
Trump threatens to tighten US sanctions against Iran
Anti-Trump protesters gather in NYC ahead of UN General Assembly
Trump suggests he deserves Nobel Peace Prize
Pressure on Pelosi to Impeach Trump Grows