Related papers: Cross-Platform Comparison of Arbitrary Quantum Pro…
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check…
In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by…
We present a quantum-analogous experimental demonstration of variational quantum process tomography using an optical processor. This approach leverages classical one-hot encoding and unitary decomposition to perform the variational quantum…
We prove that quantum random access code (QRAC) performs better than its classical counterpart only when incompatible quantum measurements are used in the decoding task. As a consequence, evaluating the average success probability for QRAC…
We give a conceptually simple necessary condition such that a separable quantum operation can be implemented by local operations on subsystems and classical communication between parties (LOCC), a condition which follows from a novel…
Quantum computing (QC) offers a new computing paradigm that has the potential to provide significant speedups over classical computing. Each additional qubit doubles the size of the computational state space available to a quantum…
Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are…
We define a time continuous version of the concept of "local operations and classical communication" (LOCC), ubiquitous in quantum information theory. It allows us to construct GKLS master equations for particle systems that have (1) an…
Quantum computers show potential for achieving computational advantage over classical computers, with many candidate applications in combinatorial optimisation. We present an application level benchmarking framework for near-term quantum…
Quantum query complexity studies the number of queries needed to learn some property of a black box. A closely related question is how well an algorithm can succeed with this learning task using only a fixed number of queries. In this work,…
Due to the limited qubit number of quantum devices, distributed quantum computing is considered a promising pathway to overcome this constraint. In this paradigm, multiple quantum processors are interconnected to form a cohesive…
Quantum computers connected through classical and quantum communication channels can be combined to function as a single unit to run large quantum circuits that each device is unable to execute on their own. The distributed quantum…
Distributed quantum information processing seeks to overcome the scalability limitations of monolithic quantum devices by interconnecting multiple quantum processing nodes via classical and quantum communication. This approach extends the…
Scalable characterization of quantum processors is crucial for mitigating noise and imperfections. While randomized measurement protocols enable efficient access to local observables, inferring a globally consistent description of…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
Randomized Benchmarking allows to efficiently and scalably characterize the average error of an unitary 2-design such as the Clifford group $\mathcal{C}$ on a physical candidate for quantum computation, as long as there are no…
We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple homogeneous or heterogeneous quantum processors in hybrid classical-quantum workflows. In this manner, we are able to overcome…
The first generation of small noisy quantum processors have recently become available to non-specialists who are not required to understand specifics of the physical platforms and, in particular, the types and sources of noise. As such, it…
Quantum processes, such as quantum circuits, quantum memories, and quantum channels, are essential ingredients in almost all quantum information processing tasks. However, the characterization of these processes remains a daunting task due…
Distributed quantum computing offers a promising approach to scaling quantum devices by networking multiple quantum processors. We present a quantum state tomography protocol tailored for distributed quantum computers that avoids assuming…