Related papers: Hardware-Tailored Diagonalization Circuits
Different hybrid quantum-classical algorithms have recently been developed as a near-term way to solve linear systems of equations on quantum devices. However, the focus has so far been mostly on the methods, rather than the problems that…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
The estimation of low energies of many-body systems is a cornerstone of computational quantum sciences. Variational quantum algorithms can be used to prepare ground states on pre-fault-tolerant quantum processors, but their lack of…
Diagonal quantum circuits are quantum circuits comprising only diagonal gates in the computational basis. In spite of a classical feature of diagonal quantum circuits in the sense of commutativity of all gates, their computational power is…
Characterization of quantum devices generates insights into their sources of disturbances. State-of-the-art characterization protocols often focus on incoherent noise and eliminate coherent errors when using Pauli or Clifford twirling…
We propose a new quantum computing formalism named Pauli quantum computing. In this formalism, we use the Pauli basis $I$ and $X$ on the non-diagonal blocks of density matrices to encode information and treat them as the computational basis…
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…
Many routines that one might want to run on a quantum computer can benefit from adaptive circuits, relying on mid-circuit measurements and feed-forward operations. Any such measurement has to be compiled into a sequence of elementary gates…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper…
Exponentiation of Hamiltonians refers to a mathematical operation to a Hamiltonian operator, typically in the form e^(-i.t.H), where H is the Hamiltonian and t is a time parameter. This operation is fundamental in quantum mechanics,…
Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum…
We present a quantum process-tomography protocol based on a low-degree ansatz for the quantum channel, i.e. when it can be expressed as a fixed-degree polynomial in terms of Pauli operators. We demonstrate how to perform tomography of such…
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…
We present tools and methods to generalize parity compilation to digital quantum computing devices with arbitrary connectivity graphs and construct circuit implementations for the constraint Hamiltonian of higher-order constrained binary…
The cost of measuring quantum expectation values of an operator can be reduced by grouping the Pauli string ($SU(2)$ tensor product) decomposition of the operator into maximally commuting sets. We detail an algorithm, presented in [1], to…
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
Circuit knitting emerges as a promising technique to overcome the limitation of the few physical qubits in near-term quantum hardware by cutting large quantum circuits into smaller subcircuits. Recent research in this area has been…