Related papers: Locality-aware Pauli-based computation for local m…

Quantum coherence, which quantifies the superposition properties of a quantum state, plays an indispensable role in quantum resource theory. A recent theoretical work [Phys. Rev. Lett. \textbf{116}, 070402 (2016)] studied the manipulation…

Via nonlocality distillation, a number of copies of a given nonlocal correlation can be turned into a new correlation displaying a higher degree of nonlocality. Apart from its clear relevance in situations where nonlocality is a resource,…

To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from…

We complete the task of optimal probabilistic coherence distillation protocol, whose aim is to transform a general state into a set of n-level maximally coherent states via strictly incoherent operations (SIO). Specifically, we present the…

We develop an efficient local operation and classical communication (LOCC) scheme for the distillation of Greenberger-Horne-Zeilinger (GHZ) states from tripartite systems subjected to both coherent and incoherent errors. The proposed method…

State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…

Pauli-based computation (PBC) is a universal measurement-based quantum computation model steered by an adaptive sequence of independent and compatible Pauli measurements on separable magic-state qubits. Here, we propose several new…

Quantum computers are poised to radically outperform their classical counterparts by manipulating coherent quantum systems. A realistic quantum computer will experience errors due to the environment and imperfect control. When these errors…

In this paper we outline a method for a compiler to translate any non fault tolerant quantum circuit to the geometric representation of the lattice surgery error-correcting code using inherent merge and split operations. Since the…

The ability to distill quantum coherence is pivotal for optimizing the performance of quantum technologies; however, such a task cannot always be accomplished with certainty. Here we develop a general framework of probabilistic distillation…

Measuring quantum observables by grouping terms that can be rotated to sums of only products of Pauli $\hat z$ operators (Ising form) is proven to be efficient in near term quantum computing algorithms. This approach requires extra unitary…

In continuous-variable systems, non-Gaussian resources are essential for achieving universal quantum computation that lies beyond classical simulation. Among the candidate states, the cubic phase state stands out as the simplest form of…

Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum…

The goal of entanglement distillation is to turn a large number of weakly entangled states into a smaller number of highly entangled ones. Practical entanglement distillation schemes offer a tradeoff between the fidelity to the target…

We introduce and study the task of assisted coherence distillation. This task arises naturally in bipartite systems where both parties work together to generate the maximal possible coherence on one of the subsystems. Only incoherent…

Efficient constructions for quantum logic are essential since quantum computation is experimentally challenging. This thesis develops quantum logic synthesis as a paradigm for reducing the resource overhead in fault-tolerant quantum…

Learning about physical systems from quantum-enhanced experiments, relying on a quantum memory and quantum processing, can outperform learning from experiments in which only classical memory and processing are available. Whereas quantum…

We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal…

Magic quantum states (non-stabilizer states) play a pivotal role in fault-tolerant quantum computation. Simultaneously, random resources have emerged as a key element in various randomized techniques within contemporary quantum science. In…

The algorithm-specific graph and circuit etching are two strategies for compiling a graph state to implement quantum computation. Benchmark testing exposed limitations to the proto-compiler, Jabalizer giving rise to Etch…