Related papers: Universality Classes of Stabilizer Code Hamiltonia…
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a…
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed…
We show that universal holonomic quantum computation (HQC) can be achieved fault-tolerantly by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground…
We introduce a type of quantum dissipation -- local quantum friction -- by adding to the Hamiltonian a local potential that breaks time-reversal invariance so as to cool the system. Unlike the Kossakowski-Lindblad master equation, local…
We derive explicit closed-form matrix representations of Hamiltonians drawn from tensored algebras, such as quantum spin Hamiltonians. These formulas enable us to soft-code generic Hamiltonian systems and to systematize the input data for…
We introduce \emph{stratified colimit codes}: stabiliser codes obtained by taking the degree-wise colimit $\mathcal C_\bullet(X):=\operatorname*{colim}_{\sigma\in X}F(\sigma)$ of a functor $F\colon X\to\mathbf{Ch}(R)$ from a finite poset…
We study properties of stabilizer codes that permit a local description on a regular D-dimensional lattice. Specifically, we assume that the stabilizer group of a code (the gauge group for subsystem codes) can be generated by local Pauli…
We introduce a generalizable framework for learning to identify effective Hamiltonians directly from experimental data in solid-state quantum systems. Our approach is based on a physics-informed neural network architecture that embeds…
We establish an analytical criterion for dynamical thermalization within harmonic systems, applicable to both classical and quantum models. Specifically, we prove that thermalization of various observables, such as particle energies in…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…
We develop a master equation formalism to describe the evolution of the average density matrix of a closed quantum system driven by a stochastic Hamiltonian. The average over random processes generally results in decoherence effects in…
We investigate two dimensional compactifications of three dimensional fractonic stabilizer models. We find the two dimensional topological phases produced as a function of compactification radius for the X-cube model and Haah's cubic code.…
We discuss encodings of fermionic many-body systems by qubits in the presence of symmetries. Such encodings eliminate redundant degrees of freedom in a way that preserves a simple structure of the system Hamiltonian enabling quantum…
Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…
Conserved quantities are crucial in quantum physics. Here we discuss a general scenario of Hamiltonians. All the Hamiltonians within this scenario share a common conserved quantity form. For unitary parametrization processes, the…
Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. However, many studies rely on toy datasets or heavy feature reduction, raising concerns about their scalability.…
We extend the results on decoherence in the thermodynamic limit [M. Frasca, Phys. Lett. A {\bf 283}, 271 (2001)] to general Hamiltonians. It is shown that N independent particles, initially properly prepared, have a set of observables…
Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators. In this paper, we propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator components of…
We study translationally invariant Pauli stabilizer codes with qudits of arbitrary, not necessarily uniform, dimensions. Using homological methods, we define a series of invariants called charge modules. We describe their properties and…