Related papers: Identifying quantum resources in encoded computati…
Typical elements of quantum networks are made by identical systems, which are the basic particles constituting a resource for quantum information processing. Whether the indistinguishability due to particle identity is an exploitable…
Quantum algorithms based on quantum kernel methods have been investigated previously [1]. A quantum advantage is derived from the fact that it is possible to construct a family of datasets for which, only quantum processing can recognise…
The nascent computational paradigm of quantum reservoir computing presents an attractive use of near-term, noisy-intermediate-scale quantum processors. To understand the potential power and use cases of quantum reservoir computing, it is…
One-time programs, computer programs which self-destruct after being run only once, are a powerful building block in cryptography and would allow for new forms of secure software distribution. However, ideal one-time programs have been…
Block encoding is a key ingredient in the recently developed quantum singular value transformation (QSVT) framework, which provides a unifying description for many quantum algorithms. Initially introduced to simplify and optimize resource…
Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation…
It has been hypothesized that quantum computers may lend themselves well to applications in machine learning. In the present work, we analyze function classes defined via quantum kernels. Quantum computers offer the possibility to…
Quantifying how much a quantum state breaks a symmetry is essential for characterizing phases, nonequilibrium dynamics, and open-system behavior. Quantum resource theory provides a rigorous operational framework to define and characterize…
Many applications of quantum computing in the near term rely on variational quantum circuits (VQCs). They have been showcased as a promising model for reaching a quantum advantage in machine learning with current noisy intermediate scale…
The Wigner function of quantum systems is an effective instrument to construct the approximate classical description of the systems for which the classical approximation is possible. During the last time, the Wigner function formalism is…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
Hybrid variational quantum algorithms are promising for solving practical problems, such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers.…
Quantum reservoir computing is an emerging field in machine learning with quantum systems. While classical reservoir computing has proven to be a capable concept of enabling machine learning on real, complex dynamical systems with many…
Without large quantum computers to empirically evaluate performance, theoretical frameworks such as the quantum statistical query (QSQ) are a primary tool to study quantum algorithms for learning classical functions and search for quantum…
Quantum coherence is a fundamental resource that quantum technologies exploit to achieve performance beyond that of classical devices. A necessary prerequisite to achieve this advantage is the ability of measurement devices to detect…
Entanglement is a key resource of quantum science for tasks that require it to be shared among participants. Within atomic, condensed matter and photonic many-body systems the distribution and sharing of entanglement is of particular…
Quantum computational advantage refers to an existence of computational tasks that are easy for quantum computing but hard for classical one. Unconditionally showing quantum advantage is beyond our current understanding of complexity…
Universal fault-tolerant quantum computation requires overcoming the Eastin--Knill theorem on quantum error correction (QEC) codes that protect information from noise. This is often accomplished through strategies like magic state…
Quantum resources, such as coherence, discord, and entanglement, play as a key role for demonstrating advantage in many computation and communication tasks. In order to find the nature behind these resources, tremendous efforts have been…
We develop an intrinsic enumerator framework for quantum error correction in unitary representations of symmetry groups. An intrinsic quantum code is a subspace of a representation $V$ of a group $G$, and errors are organized by the…