相关论文: Pauli web of the $|Y\rangle$ state surface code in…

We examine the robustness of a logical qubit in the planar surface code subject to 'measurement-errors', i.e., to local Pauli measurements at known positions. This yields a measurement-only dynamics, which is driven by the competition…

Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols…

In the implementation of quantum information systems, one type of Pauli error, such as phase-flip errors, may occur more frequently than others, like bit-flip errors. For this reason, quantum error-correcting codes that handle asymmetric…

The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a type of tensor networks that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we can intuitively reason about quantum theory, and optimise…

The partition function with ring diagrams at finite temperature is exactly caluclated by using contour integrals in the complex energy plane. It contains a pole part with temperature and momentum dependent mass and a phase shift part…

A charged particle circling in a uniform magnetic field and kicked by an electric field is considered. Under the assumption of small magnetic field, an iterative map is developed. Comparison between the (relativistic) non-radiative case and…

We consider the problem of calculating the logical error probability for a stabilizer quantum code subject to random Pauli errors. To access the regime of large code distances where logical errors are extremely unlikely we adopt the…

We develop a novel approach for efficiently applying variational quantum linear solver (VQLS) in context of structured sparse matrices. Such matrices frequently arise during numerical solution of partial differential equations which are…

An effective method for the quantitative description of the electronic excited states of polyatomic systems is developed by using computer technology. The proposed method allows calculating various properties of matter at the atomic level…

Quantum computation is inherently hybrid, and fast classical manipulation of qubit operators is necessary to ensure scalability in quantum software. We introduce PauliEngine, a high-performance C++ framework that provides efficient…

ZX-calculus has proved to be a useful tool for quantum technology with a wide range of successful applications. Most of these applications are of an algebraic nature. However, other tasks that involve differentiation and integration remain…

- An algorithm for calculating the radiation field of a charged point particle performing a spiral motion in an infinite cylindrical waveguide with a multilayer side wall is found. The number of layers and their filling is arbitrary. The…

Magic state distillation, a process for preparing magic states needed to implement non-Clifford gates fault-tolerantly, plays a crucial role in fault-tolerant quantum computation. Historically, it has been a major bottleneck, leading to the…

Surface codes represent a leading approach for quantum error correction (QEC), offering a path towards universal fault-tolerant quantum computing (FTQC). However, efficiently implementing algorithms, particularly using Pauli-based…

We utilize the symmetry groups of regular tessellations on two-dimensional surfaces of different constant curvatures, including spheres, Euclidean planes and hyperbolic planes, to encode a qubit or qudit into the physical degrees of freedom…

In this work, we present a detailed procedure of computer implementation of the laws of refraction and reflection on an arbitrary surface with rotational symmetry with respect to the propagation axis. The goal is to facilitate the…

Random (mixed) unitary channels describe an important subset of quantum channels, which are commonly used in quantum information, noise modeling, and quantum error mitigation. Despite their usefulness, there is substantial complexity in…

Results of number of geometric operations (often used in technical practise, as e.g. the operation of blending) are in many cases surfaces described implicitly. Then it is a challenging task to recognize the type of the obtained surface,…

We study a family of tessellations of the Euclidean plane which are obtained by local developments of algebraic equations satisfied by the Pauli matrices.

Circuit theory has been tremendously successful in translating physical equations into circuit elements in organized form for further analysis and proposing creative designs for applications. With the advent of new materials and phenomena…