Search

A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling algorithms based on Wigner functions, with the important distinction that Wigner functions can take negative values obstructing the sampling. Indeed, negativity in Wigner functions has been identified as a precondition for a quantum speed-up. However, in the present method of classical simulation, negativity of quasiprobability functions never arises. This model remains probabilistic for all quantum computations. In this paper, we analyze the amount of classical data that the simulation procedure must track. We find that this amount is small. Specifically, for any number n of magic states, the number of bits that describe the quantum system at any given time is 2n^{2}+O(n).

In computer and system sciences, higher-order cellular automata (HOCA) are a type of cellular automata that evolve over multiple time steps and generate complex patterns, which have various applications, such as secret-sharing schemes, data compression, and image encryption. In this paper, we introduce HOCA to quantum many-body physics and construct a series of symmetry-protected topological (SPT) phases of matter, in which symmetries are supported on a great variety of subsystems embbeded in the SPT bulk. We call these phases HOCA-generated SPT (HGSPT) phases. Specifically, we show that HOCA can generate not only well-understood SPTs with symmetries supported on either regular (e.g., linelike subsystems in the two-dimensional cluster model) or fractal subsystems, but also a large class of unexplored SPTs with symmetries supported on more choices of subsystems. One example is mixed-subsystem SPT that has either fractal and linelike subsystem symmetries simultaneously or two distinct types of fractal symmetries simultaneously. Another example is chaotic-subsystem SPT in which chaotic-looking symmetries are significantly different from and thus cannot reduce to fractal or regular subsystem symmetries. We also introduce a new notation system to characterize HGSPTs. We prove that all possible subsystem symmetries in a square lattice can be locally simulated by an HOCA-generated symmetry. As the usual two-point strange correlators are trivial in most HGSPTs, we find that the nontrivial SPT orders can be detected by what we call multi point strange correlators. We propose a universal procedure to design the spatial configuration of the multi point strange correlators for a given HGSPT phase. Specifically, we find deep connections between multi point strange correlators and the spurious topological entanglement entropy (STEE), both exhibiting long-range behavior in a short-range entangled state. Our HOCA approaches and multi point strange correlators pave the way for a unified paradigm to design, classify, and detect phases of matter with symmetries supported on a great variety of subsystems, and also provide potential useful perspective in surpassing the computational irreducibility of HOCA in a quantum mechanical way.

In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to Z_{d} qudits, including instances where d is a nonprime number. This capability allows the identification of topological orders that differ from the Z_{d} toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for Z_{p} qudits (with p being a prime) are equivalent to finite copies of Z_{p} toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order.

Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage—namely, a significant (in some cases exponential) speedup of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small-scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models that are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this Roadmap paper, led by CERN, DESY, and IBM, we provide the status of high-energy physics quantum computations and give examples of theoretical and experimental target benchmark applications, which can be addressed in the near future. Having in mind hardware with about 100 qubits capable of executing several thousand two-qubit gates, where possible, we also provide resource estimates for the examples given using error-mitigated quantum computing. The ultimate declared goal of this task force is therefore to trigger further research in the high-energy physics community to develop interesting use cases for demonstrations on near-term quantum computers.

Quantum instruments represent the most general type of quantum measurement, as they incorporate processes with both classical and quantum outputs. In many scenarios, it may be desirable to have some “on-demand” device that is capable of implementing one of many possible instruments whenever the experimenter desires. We refer to such objects as programmable instrument devices (PIDs), and this paper studies PIDs from a resource-theoretic perspective. A physically important class of PIDs are those that do not require quantum memories to implement, and these are naturally “free” in this resource theory. Additionally, these free objects correspond precisely to the class of unsteerable channel assemblages in the study of channel steering. The traditional notion of measurement incompatibility emerges as a resource in this theory since any PID controlling an incompatible family of instruments requires a quantum memory to build. We identify an incompatibility preorder between PIDs based on whether one can be transformed into another using processes that do not require additional quantum memories. Necessary and sufficient conditions are derived for when such transformations are possible based on how well certain guessing games can be played using a given PID. Ultimately our results provide an operational characterization of incompatibility, and they offer semi-device-independent tests for incompatibility in the most general types of quantum instruments.

A quantum impulse is a brief but strong perturbation that produces a sudden change in a wave function ψ(x). We develop a theory of quantum impulses, distinguishing between ordinary and super impulses. An ordinary impulse paints a phase onto ψ, while a super impulse—the main focus of this paper—deforms the wave function under an invertible map, μ:x→x^{′}. Borrowing tools from optimal-mass-transport theory and shortcuts to adiabaticity, we show how to design a super impulse that deforms a wave function under a desired map μ and we illustrate our results using solvable examples. We point out a strong connection between quantum and classical super impulses, expressed in terms of the path-integral formulation of quantum mechanics. We briefly discuss hybrid impulses, in which ordinary and super impulses are applied simultaneously. While our central results are derived for evolution under the time-dependent Schrödinger equation, they apply equally well to the time-dependent Gross-Pitaevskii equation and thus may be relevant for the manipulation of Bose-Einstein condensates.