SearcharxivSearch

arXiv · 2103.07865

Reply to Comment on "Nonlinear quantum effects in electromagnetic radiation of a vortex electron" by A. Karnieli, R. Remez, I. Kaminer, et al

Abstract

We argue that while the experiment of Remez et al. is interesting and its conclusions may well be correct, the observed lack of dependence of the measured distributions on the electron's transverse coherence length should have been expected for the parameters chosen. This is because for Smith-Purcell radiation it is the coherence length of a virtual photon that plays a role of the radiation formation width and not the entire electron's coherence length that can well be orders of magnitude larger. This is a common feature for all the radiation processes in which a photon is emitted not directly by the electron, which can be delocalized in space, but rather by a much better localized atom or a conduction electron on a surface. Therefore, in our opinion the results of Remez et al. cannot rule out the alternative hypothesis of the delocalized charge. The question, mainly addressed in the comment by Karnieli et al., of whether the measurements were performed in the wave zone or not is interesting but secondary. We emphasize that the measured distributions are unusually wide and neither the original paper nor the recent comment fully discusses and rules out all alternative hypotheses that could have led to the same distributions. On the contrary, there exists a family of classical effects that could also have resulted in the measured distributions and that were neither discussed nor even mentioned by the authors. Such alternative hypotheses include (i) effects of the beam sizes, of its angular divergence, of the temporal coherence of the process, and (ii) influence of the grating shape and of its material. Finally, we propose to repeat the experiment and to measure diffraction radiation from a thin metallic semi-plane or Compton emission in a laser pulse. In these cases, the classical effects play a much smaller role and the results of such measurements would have higher credibility.

Explore related subjects

Keep this discovery

BibTeXRIS

D. V. Karlovets, A. M. Pupasov-Maksimov. 2021-03-14. Reply to Comment on "Nonlinear quantum effects in electromagnetic radiation of a vortex electron" by A. Karnieli, R. Remez, I. Kaminer, et al. https://doi.org/10.1103/physreva.105.036203

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph