Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPath-Independent Quantum Gates with Noisy Ancilla
175
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Ancilla systems are often indispensable to universal control of a nearly isolated quantum system. However, ancilla systems are typically more vulnerable to environmental noise, which limits the performance of such ancilla-assisted quantum control. To address this challenge of ancilla-induced decoherence, we propose a general framework that integrates quantum control and quantum error correction, so that we can achieve robust quantum gates resilient to ancilla noise. We introduce the path independence criterion for fault-tolerant quantum gates against ancilla errors. As an example, a path-independent gate is provided for superconducting circuits with a hardware-efficient design.
rate research
Read More
We present methods for the direct characterization of quantum dynamics (DCQD) in which both the principal and ancilla systems undergo noisy processes. Using a concatenated error detection code, we discriminate between located and unlocated errors on the principal system in what amounts to filtering of ancilla noise. The example of composite noise involving amplitude damping and depolarizing channels is used to demonstrate the method, while we find the rate of noise filtering is more generally dependent on code distance. Our results indicate the accuracy of quantum process characterization can be greatly improved while remaining within reach of current experimental capabilities.
We show how the spin independent scattering between two identical flying qubits can be used to implement an entangling quantum gate between them. We consider one dimensional models with a delta interaction in which the qubits undergoing the collision are distinctly labeled by their opposite momenta. The logical states of the qubit may either be two distinct spin (or other internal) states of a fermion or a boson or two distinct momenta magnitudes of a spinless boson. Our scheme could be added to linear optics-like quantum information processing to enhance its efficiency, and can also aid the scaling of quantum computers based on static qubits without resorting to photons. Three distinct ingredients -- the quantum indistinguishability of the qubits, their interaction, and their dimensional confinement, come together in a natural way to enable the quantum gate.
We review the use of an external auxiliary detector for measuring the full distribution of the work performed on or extracted from a quantum system during a unitary thermodynamic process. We first illustrate two paradigmatic schemes that allow one to measure the work distribution: a Ramsey technique to measure the characteristic function and a positive operator valued measure (POVM) scheme to directly measure the work probability distribution. Then, we show that these two ideas can be understood in a unified framework for assessing work fluctuations through a generic quantum detector and describe two protocols that are able to yield complementary information. This allows us also to highlight how quantum work is affected by the presence of coherences in the systems initial state. Finally, we describe physical implementations and experimental realisations of the first two schemes.
We present a general decomposition of the Generalized Toffoli, and for completeness, the multi-target gate using an arbitrary number of clean or dirty ancilla. While prior work has shown how to decompose the Generalized Toffoli using 0, 1, or $O(n)$ many clean ancilla and 0, 1, and $n-2$ dirty ancilla, we provide a generalized algorithm to bridge the gap, i.e. this work gives an algorithm to generate a decomposition for any number of clean or dirty ancilla. While it is hard to guarantee optimality, our decompositions guarantee a decrease in circuit depth as the number of ancilla increases.
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary $t$-designs mimic the Haar-measure up to $t$-th moments. It is known that Clifford operations can implement at most $3$-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject $O(t^{4}log^{2}(t)log(1/varepsilon))$ many non-Clifford gates into a polynomial-depth random Clifford circuit to obtain an $varepsilon$-approximate $t$-design. Strikingly, the number of non-Clifford gates required is independent of the system size -- asymptotically, the density of non-Clifford gates is allowed to tend to zero. We also derive novel bounds on the convergence time of random Clifford circuits to the $t$-th moment of the uniform distribution on the Clifford group. Our proofs exploit a recently developed variant of Schur-Weyl duality for the Clifford group, as well as bounds on restricted spectral gaps of averaging operators.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
