相关论文: Error Avoiding Quantum Codes and Dynamical Stabili…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
Conventional fault-tolerant quantum error-correction schemes require a number of extra qubits that grows linearly with the code's maximum stabilizer generator weight. For some common distance-three codes, the recent "flag paradigm" uses…
The decoherence effect on Grover algorithm has been studied numerically through a noise modelled by a depolarizing channel. Two types of error are introduced characterizing the qubit time evolution and gate application, so the noise is…
Grover search is a renowned quantum search algorithm that leverages quantum superposition to find a marked item with quadratic speedup. However, when implemented on Noisy Intermediate-scale Quantum (NISQ) hardware, the required repeated…
Geometric quantum computation offers a potential route to fault-tolerant quantum information processing by exploiting the global nature of geometric phases. However, achieving controlled high-order suppression of multiple error sources…
Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least…
We invoke an efficient search algorithms as a key challenge in multi-qubit quantum systems. An original algorithm called dynamical quantum search algorithm from which Grover algorithm is obtained at a specified time is presented. This…
A promising strategy to protect quantum information from noise-induced errors is to encode it into the low-energy states of a topological quantum memory device. However, readout errors from such memory under realistic settings is less…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
Amplitude Amplification -- a key component of Grover's Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. We present novel strategies to enhance the amplification…
We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. To accomplish this, we encode the original state by…
We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes an algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that…
We study variants of Shor's code that are adept at handling single-axis correlated idling errors, which are commonly observed in many quantum systems. By using the repetition code structure of the Shor's code basis states, we calculate the…
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit to avoid resource escalation typical of multi-qubit codes. These codes can be customized to the specific physical errors on the qudit,…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
We investigate the stability of logical information in quantum stabilizer codes subject to coherent unitary errors. Beginning with a logical state, we apply a random unitary error channel and subsequently measure stabilizer checks,…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine…
Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing without the heavy resource overheads required by fault tolerant schemes. Recently, error mitigation has been…
Active stabilisation of a quantum system is the active suppression of noise (such as decoherence) in the system, without disrupting its unitary evolution. Quantum error correction suggests the possibility of achieving this, but only if the…