Related papers: Transpiling Quantum Circuits using the Pentagon Eq…
We present a microscopic approach to quantum dissipation and sketch the derivation of the kinetic equation describing the evolution of a simple quantum system in interaction with a complex quantum system. A typical quantum complex system is…
Novel qubits with intrinsic noise protection constitute a promising route for improving the coherence of quantum information in superconducting circuits. However, many protected superconducting qubits exhibit relatively low transition…
Modern quantum experiments provide examples of transport with non-commuting quantities, offering a tool to understand the interplay between thermal and quantum effects. Here we set forth a theory for non-Abelian transport in the linear…
We construct quantum circuits which exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced "qubitization" framework, one can use…
We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first…
Given two quantum states of N q-bits we are interested to find the shortest quantum circuit consisting of only one- and two- q-bit gates that would transfer one state into another. We call it the quantum maze problem for the reasons…
In a previous publication [1] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the…
We introduce a numerical strategy to efficiently solve the out-of-equilibrium Dyson equation in the transient regime. By discretizing the equation into a compact matrix form and applying state-of-the-art matrix compression techniques, we…
Solid state superconducting devices coupled to coplanar transmission lines offer an exquisite architecture for quantum optical phenomena probing as well as for quantum computation implementation, being the object of intense theoretical and…
It is shown that the Heisenberg double has a canonical element, satisfying the pentagon relation. From a given invertible constant solution to the pentagon relation one can restore the structure of the underlying algebras. Drinfeld double…
Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…
We consider a pentagon chain described by a Hubbard type of model considered under periodic boundary conditions. The system i) is placed in an external magnetic field perpendicular to the plane of the cells, and ii) is in a site selective…
Analytical solutions describing quantum swap and Hadamard gate are given with the use of tight-binding approximation. Decoherence effects are described analytically for two interacting electrons confined by local potentials with use of…
We derive an analytical approximate solution of the time-dependent state vector in terms of material Bell states and coherent states of the field for a generalized two-atom Tavis-Cummings model with nonlinear intensity dependent…
We theoretically study operations with a four-level superconducting circuit as a two-qubit system. Using a mapping on a two-qubit system, we show how to implement iSWAP gates and Hadamard gates through pulses on transitions between…
Transistors play a vital role in classical computers, and their quantum mechanical counterparts could potentially be as important in quantum computers. Where a classical transistor is operated as a switch that either blocks or allows an…
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…
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit…
The rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum…
QuYBE is an open-source algebraic compiler for the compression of quantum circuits. It has been applied for the efficient simulation of the Heisenberg Hamiltonian on quantum computers. Currently, it can simulate the time dynamics of…