Related papers: Diagonal operator decomposition on restricted topo…
This paper proposes a new optimized quantum block-ZXZ decomposition method [7,8,10] that results in more optimal quantum circuits than the quantum Shannon decomposition (QSD)[27], which was introduced in 2006 by Shende et al. The…
Many different deep networks have been used to approximate, accelerate or improve traditional image operators, such as image smoothing, super-resolution and denoising. Among these traditional operators, many contain parameters which need to…
We introduce a task that we call partial decoupling, in which a bipartite quantum state is transformed by a unitary operation on one of the two subsystems and then is subject to the action of a quantum channel. We assume that the subsystem…
We propose a protocol for quantum adiabatic optimization, whereby an intermediary Hamiltonian that is diagonal in the computational basis is turned on and off during the interpolation. This `diagonal catalyst' serves to bias the energy…
Implementing precise operations on quantum systems is one of the biggest challenges for building quantum devices in a noisy environment. Dynamical decoupling (DD) attenuates the destructive effect of the environmental noise, but so far it…
Dynamical decoupling is a powerful technique to suppress errors in quantum systems originating from environmental couplings or from unwanted inter-particle interactions. However, it can also be used to selectively decouple specific…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
For most practical applications, quantum algorithms require large resources in terms of qubit number, much larger than those available with current NISQ processors. With the network and communication functionalities provided by the Quantum…
This manuscript is aimed at addressing several long standing limitations of dynamic mode decompositions in the application of Koopman analysis. Principle among these limitations are the convergence of associated Dynamic Mode Decomposition…
We consider four-component Dirac operators on domains in the plane. With suitable boundary conditions, these operators describe graphene quantum dots. The most general boundary conditions are defined by a matrix depending on four real…
We examine the ability of gate-based continuous-variable quantum computers to outperform qubit or discrete-variable quantum computers. Gate-based continuous-variable operations refer to operations constructed using a polynomial sequence of…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit…
We analyze possible implementations of quantum algorithms in a system of (macroscopic) Josephson charge qubits. System layout and parameters to realize the Deutsch algorithm with up to three qubits are provided. Special attention is paid to…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
The quantum computing paradigm in photonics currently relies on the multi-port interference in linear optical devices, which is intrinsically based on probabilistic measurements outcome and thus non-deterministic. Devising a fully…
A common approach to quantum circuit transformation is to use the properties of a specific gate set to create an efficient representation of a given circuit's unitary, such as a parity matrix or stabiliser tableau, and then resynthesise an…
Unitary operation is an essential step for quantum information processing. We first propose an iterative procedure for decomposing a general unitary operation without resorting to controlled-NOT gate and single-qubit rotation library. Based…
We propose a scheme for scalable and universal quantum computation using diatomic bits with conditional dipole-dipole interaction, trapped within an optical lattice. The qubit states are encoded by the scattering state and the bound…
Facing the worldwide steady progress in building quantum computers, it is crucial for cryptographic community to design quantum-safe cryptographic primitives. To achieve this, we need to investigate the capability of cryptographic analysis…