Related papers: Quantum simulation of Pauli channels and dynamical…
The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here we present two algorithms that, in conjunction with other methods developed…
Efficient simulation of quantum computers is essential for the development and validation of near-term quantum devices and the research on quantum algorithms. Up to date, two main approaches to simulation were in use, based on either full…
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…
Quantum computing has shown tremendous promise in addressing complex computational problems, yet its practical realization is hindered by the limited availability of qubits for computation. Recent advancements in quantum hardware have…
Quantum simulation is one of the central discipline to demonstrate the power of quantum computing. In recent years, the theoretical framework of quantum superchannels has been developed and applied widely as the extension of quantum…
The simulation of quantum dynamics on a digital quantum computer with parameterized circuits has widespread applications in fundamental and applied physics and chemistry. In this context, using the hybrid quantum-classical algorithm,…
Current quantum computers suffer from a limited number of qubits and high error rates, limiting practical applicability. Different techniques exist to mitigate these effects and run larger algorithms. In this work, we analyze one of these…
Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, characterized by the number of $T$ gates or stabilizer rank, to…
The design and optimization of realistic architectures for fault-tolerant quantum computation requires error models that are both reliable and amenable to large-scale classical simulation. Perhaps the simplest and most practical…
The accuracy of any physical scheme used to estimate the parameter describing the strength of a single qubit Pauli channel can be quantified using standard techniques from quantum estimation theory. It is known that the optimal estimation…
Several linear algebra routines for quantum computing use a basis of tensor products of identity and Pauli operators to describe linear operators, and obtaining the coordinates for any given linear operator from its matrix representation…
We introduce and investigate a data access model (approximate sample and query) that is satisfiable by the preparation and measurement of block encoded states, as well as in contexts such as classical quantum circuit simulation or Pauli…
Decomposing Pauli exponentials efficiently to quantum circuits has been the subject of intense research in recent years. Pauli exponentials are an essential component of many different quantum algorithms. Due to the error-prone nature of…
Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, LOWESA (low weight efficient simulation…
Non-Markovian noise, arising from the memory effect in the environment, poses substantial challenges to conventional quantum noise suppression protocols, including quantum error correction and mitigation. We introduce a channel…
We introduce graph state basis diagonalization to calculate the coherent information of a quantum code passing through a Pauli channel. The scheme is 5000 times faster than the best known one for some concatenated repetition codes,…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
One of the first proposals for the use of quantum computers was the simulation of quantum systems. Over the past three decades, great strides have been made in the development of algorithms for simulating closed quantum systems and the more…
Quantum circuits are time dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal synthesis of quantum circuits is intractable and heuristic methods must…
Quantum errors in noisy environments remain a major obstacle to advancing quantum information technology. In this work, we expand a recently developed geometric framework, originally utilized for analyzing noise accumulation and creating…