相关论文: Effects of quantum resources on the statistical co…
In an idealistic setting, quantum metrology protocols allow to sense physical parameters with mean squared error that scales as $1/N^2$ with the number of particles involved---substantially surpassing the $1/N$-scaling characteristic to…
Quantum resources lie at the core of quantum computation as they are responsible for the computational advantage in many tasks. The complementary relations are a pathway to understanding how the physical quantities are related. Here it was…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
Quantum addition based on the quantum Fourier transform can be an integral part of a quantum circuit and proved to be more efficient than the existing classical ripple carry adder. Our study includes identifying the quantum resource…
Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. We seek to…
The problem of simulatability of quantum processes using classical resources plays a cornerstone role for quantum computing. Quantum circuits can be simulated classically, e.g., using Monte Carlo sampling techniques applied to…
Variational quantum circuits (VQCs) are typically evaluated at the logical design level when analyzing trainability. However, execution on real quantum devices requires hardware-aware compilation (transpilation) to satisfy qubit…
We investigate the role of a statistical complexity measure to assign equilibration in isolated quantum systems. While unitary dynamics preserve global purity, expectation values of observables often exhibit equilibration-like behavior,…
We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuits are hard to classically simulate up to multiplicative…
Quantum advantage schemes probe the boundary between classically simulatable and classically intractable quantum dynamics. We explore the impact of mid-circuit measurements on the computational power of quantum circuits. To this effect, we…
Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of…
Increasingly sophisticated programmable quantum simulators and quantum computers are opening unprecedented opportunities for exploring and exploiting the properties of highly entangled complex quantum systems. The complexity of large…
Recently, the projective robustness of quantum states has been introduced in [arXiv:2109.04481(2021)]. It shows that the projective robustness is a useful resource monotone and can comprehensively characterize capabilities and limitations…
The main reason for query model's prominence in complexity theory and quantum computing is the presence of concrete lower bounding techniques: polynomial and adversary method. There have been considerable efforts to give lower bounds using…
We present a thorough investigation of nonstabilizerness - a fundamental quantum resource that quantifies state complexity within the framework of quantum computing - in a one-dimensional U(1) lattice gauge theory. We show how…
Capacities of quantum channels are fundamental quantities in the theory of quantum information. A desirable property is the additivity for a capacity. However, this cannot be achieved for a few quantities that have been established as…
Contextuality has been conjectured to be a super-classical resource for quantum computation, analogous to the role of non-locality as a super-classical resource for communication. We show that the presence of contextuality places a lower…
We have proved new estimates for the coherent control errors of quantum circuits used in quantum computing. These estimates essentially take into account the commutator properties of the Hamiltonians and are based on the formulas of the…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the…