Related papers: Quantum chaos and random matrix theoryfor fidelity…
As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum gates on a one-dimensional array purely via signals that…
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
We explore the effect of a system's symmetries on fidelity decay behavior. Chaos-like exponential fidelity decay behavior occurs in non-chaotic systems when the system possesses symmetries and the applied perturbation is not tied to a…
The variational principle of quantum mechanics is the backbone of hybrid quantum computing for a range of applications. However, as the problem size grows, quantum logic errors and the effect of barren plateaus overwhelm the quality of the…
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations to a universal set by the addition of `magic' quantum states. In this context, we develop a general…
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 describe new implementations of quantum error correction that are continuous in time, and thus described by continuous dynamical maps. We evaluate the performance of such schemes using numerical simulations, and comment on the…
We characterize the quantum gate fidelity in a state-independent manner by giving an explicit expression for its variance. The method we provide can be extended to calculate all higher order moments of the gate fidelity. Using these results…
Quantum chaos is presented as a paradigm of information processing by dynamical systems at the bottom of the range of phase-space scales. Starting with a brief review of classical chaos as entropy flow from micro- to macro-scales, I argue…
Characterising the time over which quantum coherence survives is critical for any implementation of quantum bits, memories and sensors. The usual method for determining a quantum system's decoherence rate involves a suite of experiments…
This paper establishes the applicability of density functional theory methods to quantum computing systems. We show that ground-state and time-dependent density functional theory can be applied to quantum computing systems by proving the…
We describe a new and consistent perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by non-resonant transitions are estimated. We verify our…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…
By using quantum mechanical effects, quantum computers promise significant speedups in solving problems intractable for conventional computers. However, despite recent progress they remain limited in scaling and availability-making quantum…
Realistic multi-qubit noise processes often result in error mechanisms that are not captured by the probabilistic, Markovian error models commonly employed in circuit-level analyses of quantum fault-tolerance. By working within an…
The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…
In this paper we review our recent work on the theoretical approach to quantum Loschmidt echoes, i.e. various properties of the so called echo dynamics -- the composition of forward and backward time evolutions generated by two slightly…
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…