Related papers: Construction of the Complete Set of Maximally Enta…
Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by non-unitary, dynamic circuits.…
Measurement outcomes on quantum systems exhibit inherent randomness and are fundamentally nondeterministic. This has enabled quantum physics to set new standards for the generation of true randomness with significant applications in the…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
For a system of N qubits, spanning a Hilbert space of dimension d=2^N, it is known that there exists d+1 mutually unbiased bases. Different construction algorithms exist, and it is remarkable that different methods lead to sets of bases…
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
In this letter we present a scheme for generating maximally entangled states of two cavity modes which enables us to generate complete set of Bell basis states having rather simple initial state preparation. Furthermore, we study the…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
We explicitly construct a quantum circuit which exactly generates random three-qubit states. The optimal circuit consists of three CNOT gates and fifteen single qubit elementary rotations, parametrized by fourteen independent angles. The…
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 propose the variational quantum singular value decomposition based on encoding the elements of the considered { $N\times N$} matrix into the state of a quantum system of appropriate dimension. This method doesn't use the expansion of…
Based on maximally entangled states, we explore the constructions of mutually unbiased bases in bipartite quantum systems. We present a new way to construct mutually unbiased bases by difference matrices in the theory of combinatorial…
The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
Quantum computing is an emerging technology that has the potential to achieve exponential speedups over their classical counterparts. To achieve quantum advantage, quantum principles are being applied to fields such as communications,…
First, we show how the quantum circuits for generating and measuring multi-party entanglement of qubits can be translated to continuous quantum variables. We derive sufficient inseparability criteria for $N$-party continuous-variable states…
We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three…
Entanglement is an important phenomenon that enables quantum information processing algorithms and quantum communications protocols. Although entangled quantum states are often described in radix-2, higher-radix qudits can become entangled…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most…