相关论文: Noise robustness and threshold of many-body quantu…

We investigate how noise impacts nonstabilizerness - a key resource for quantum advantage - in many-body qubit systems. While noise typically degrades quantum resources, we show that amplitude damping, a nonunital channel, can generate or…

Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation. To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is…

Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states and plays a fundamental role from quantum state complexity to universal fault-tolerant quantum computing. However, analytical or…

Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient…

How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all…

We study the robustness of the GHZ (or ``cat'') class of multi-partite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the…

Magic describes the distance of a quantum state to its closest stabilizer state. It is -- like entanglement -- a necessary resource for a potential quantum advantage over classical computing. We study magic, quantified by stabilizer…

Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite…

We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multi-qubit gates are…

We consider properties of states of many qubits, which arise after sending certain entangled states via various noisy channels (white noise, coloured noise, local depolarization, dephasing and amplitude damping). Entanglement of these…

For a quantum computer acting on d-dimensional systems, we analyze the computational power of circuits wherein stabilizer operations are perfect and we allow access to imperfect non-stabilizer states or operations. If the noise rate…

Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the…

Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states…

Some properties of multi-qubit systems interacting with noisy environment is discussed. The amount of the survival entanglement is quantified for the GHZ and W-states. It is shown that the entanglement decay depends on the noise type (…

Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. The growth in complexity of quantum processing units (QPUs) demands robust and scalable techniques for characterizing this resource. We introduce the…

Notions of nonstabilizerness, or "magic", quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce 'pseudomagic' ensembles of quantum states that,…

A method to study strongly interacting quantum many-body systems at and away from criticality is proposed. The method is based on a MERA-like tensor network that can be efficiently and reliably contracted on a noisy quantum computer using a…

The dependence of quantum algorithms on state fidelity is difficult to characterize analytically and is best explored experimentally as hardware scales and noisy simulations become intractable. While low fidelity states are often…

Entanglement plays an indispensable role in numerous quantum information and quantum computation tasks, underscoring the need for efficiently verifying entangled states. In recent years, quantum state verification has received increasing…

The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy…