Related papers: Robustness of cluster states and surface code stat…
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing…
The central challenge in building a quantum computer is error correction. Unlike classical bits, which are susceptible to only one type of error, quantum bits ("qubits") are susceptible to two types of error, corresponding to flips of the…
Achieving high-fidelity entangling operations between qubits consistently is essential for the performance of multi-qubit systems and is a crucial factor in achieving fault-tolerant quantum processors. Solid-state platforms are particularly…
To avoid prohibitive overheads in performing fault-tolerant quantum computation, the decoding problem needs to be solved accurately and at speeds sufficient for fast feedback. Existing decoding systems fail to satisfy both of these…
Remarkable breakthroughs in quantum science and technology are demanding for more efficient methods in analyzing quantum many-body states. A significant challenge in this field is to verify whether a quantum state prepared by quantum…
We analyze robustness of decoherence-free (DF) subspace in charge qubits when there are a local structure and non-uniformity that violate collective decoherence measurement condition. We solve master equations of up to four charge qubits…
Quantum error correction is a key challenge for the development of practical quantum computers, a direction in which significant experimental progress has been made in recent years. In solid-state qubits, one of the leading information loss…
One of the many interesting features of quantum nonlocality is that the states of a multipartite quantum system cannot always be distinguished as well by local measurements as they can when all quantum measurements are allowed. In this…
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum…
Coherent control errors, for which ideal Hamiltonians are perturbed by unknown multiplicative noise terms, are a major obstacle for reliable quantum computing. In this paper, we present a framework for analyzing the robustness of quantum…
Most quantum error correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $\ket{0}$, which can be used as ancilla qubits to prepare multi-qubit logical states. In this report, we examine the…
Fault-tolerant quantum computing based on surface codes has emerged as a popular route to large-scale quantum computers capable of accurate computation even in the presence of noise. Its popularity is, in part, because the fault-tolerance…
Quantum computers have the potential to change the way we solve computational problems. Due to the noisy nature of qubits, the need arises to correct physical errors occurring during computation. The surface code is a promising candidate…
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse that may…
Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in…
Numerous quantum many-body systems are characterized by either fundamental or emergent constraints---such as gauge symmetries or parity superselection for fermions---which effectively limit the accessible observables and realizable…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales.…
We address the experimental determination of entropic quantum discord for systems made of a pair of polarization qubits. We compare results from full and partial tomography and found that the two determinations are statistically compatible,…
Quantum error correction will be a necessary component towards realizing scalable quantum computers with physical qubits. Theoretically, it is possible to perform arbitrarily long computations if the error rate is below a threshold value.…