Robustness of Shor's algorithm

超立方体上仅测量第一或同时测量第一和第二近邻时量子随机游走搜索算法的鲁棒性

Robustness of Quantum Random Walk Search Algorithm in Hypercube when only first or both first and second neighbors are measured

本文研究了超立方体上量子随机游走搜索算法两种修改版的鲁棒性，发现包含第一和第二近邻测量的修改能显著提升算法在大硬币维度下的稳定性。

量子控制与量子控制算法的鲁棒性与保真度的统计特性刻画

Statistically Characterising Robustness and Fidelity of Quantum Controls and Quantum Control Algorithms

本文提出RIM_p和ARIM测度以统计量化量子控制的鲁棒性与保真度，发现在含噪优化目标下强化学习等自适应决策方法比标准算法更具成本优势且保真度更一致。

Robustness of adiabatic quantum computation

We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.

Robustness to spontaneous emission of a variational quantum algorithm

We study theoretically the effects of dissipation on the performances of a variational quantum algorithm used to approximately solve a combinatorial optimization problem, the Maximum Independent Set, on a platform of neutral atoms. We take a realistic model of dissipation with spontaneous emission, and show numerically that the detrimental effects of these incoherent processes are spontaneously attenuated by the variational nature of the procedure. We furthermore implement an alternative optimization scheme recently proposed, where one uses the expected shortfall of the mean energy as the obje…

基于不同相位广义Householder反射的Grover算法不同修改的鲁棒性

Robustness of different modifications of Grovers algorithm based on generalized Householder reflections with different phases

本文研究了基于广义Householder反射的五种Grover算法修改对相位误差的鲁棒性，通过半经验方法分析了概率与相位误差的依赖关系，为预测和比较更大寄存器规模下量子算法的整体行为提供了工具。

具有多相位匹配的量子随机游走搜索的鲁棒性

Robustness of Quantum Random Walk Search with multi-phase matching

本文研究超立方体量子随机游走搜索在迭代相关多相位下的鲁棒性，通过六组相位序列数值实验表明特定序列可在无需保持相位联系时提升抗误差能力。

Accelerated adiabatic quantum gates: optimizing speed versus robustness

We develop new protocols for high-fidelity single qubit gates that exploit and extend theoretical ideas for accelerated adiabatic evolution. Our protocols are compatible with qubit architectures with highly isolated logical states, where traditional approaches are problematic; a prime example are superconducting fluxonium qubits. By using an accelerated adiabatic protocol we can enforce the desired adiabatic evolution while having gate times that are comparable to the inverse adiabatic energy gap (a scale that is ultimately set by the amount of power used in the control pulses). By modelling t…

Shor's Quantum Factoring Algorithm

This paper is a written version of a one hour lecture given on Peter Shor's quantum factoring algorithm.

High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study

In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters. By applying deep neural network we make prediction for the parameters of an optimal coin with arbitrary size and estimate the stability for such coin.

量子算法的鲁棒性：最坏情况保真度界限及其对设计的影响

Robustness of quantum algorithms: Worst-case fidelity bounds and implications for design

本文提出了一种以算法为中心的框架，用于通过推导最坏情况保真度界限来提高量子算法对误差的鲁棒性，并展示了该框架在算法分析和鲁棒优化中的应用。

经典和量子学习算法中关于鲁棒性和准确性的基本问题

Fundamental questions on robustness and accuracy for classical and quantum learning algorithms

本文研究了经典和量子学习算法在噪声和对抗性条件下准确性与鲁棒性之间的关系，提出了新的定义并探讨了权衡与避免权衡的条件。

Robustness Verification of Quantum Classifiers

Several important models of machine learning algorithms have been successfully generalized to the quantum world, with potential speedup to training classical classifiers and applications to data analytics in quantum physics that can be implemented on the near future quantum computers. However, quantum noise is a major obstacle to the practical implementation of quantum machine learning. In this work, we define a formal framework for the robustness verification and analysis of quantum machine learning algorithms against noises. A robust bound is derived and an algorithm is developed to check wh…

量子算法对相干控制误差的鲁棒性

Robustness of quantum algorithms against coherent control errors

针对相干控制误差，本文提出基于 Lipschitz 界的最坏情形保真度分析框架，并以降低哈密顿量范数为鲁棒设计与转译准则，通过 QFT、变分算法及真机实验验证其有效性。