Related papers: Harmonic flow field representations of quantum bit…
The electron-photon interaction in 2D materials obeys the rule of electron valley-photon polarization correspondence. At the quantum level, such correspondence can be utilized to entangle valleys and polarizations and attain the transfer of…
Bipartite correlations in multi-qubit systems cannot be shared freely. The presence of entanglement or classical correlation on certain pairs of qubits may imply correlations on other pairs. We present a method of characterization of…
Entangled qudits, the high-dimensional entangled states, play an important role in the study of quantum information. How to prepare entangled qudits in an efficient and easy-to-operate manner is still a challenge in quantum technology.…
This paper presents an introduction to geometric representations of quantum states in which each distinct quantum state, pure and mixed, corresponds to a unique point in a Euclidean space. Beginning with a review of some underappreciated…
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…
Finite-depth quantum circuits preserve the long-range entanglement structure in quantum states and map between states within a gapped phase. To map between states of different gapped phases, we can use Sequential Quantum Circuits which…
We study the entanglement creation between two flux qubits interacting with electromagnetic field modes. No direct interaction between the qubits exists. Entanglement is reached using entanglement swapping method by an interference…
Different from the previous works on generating entangled states, this work is focused on how to transfer the prepared entangled states onto memory qubits for protecting them against decoherence. We here consider a physical system…
Simulating physical systems with variational quantum algorithms is a well-studied approach, but it is challenging to implement in current devices due to demands in qubit number and circuit depth. We show how limited knowledge of the system,…
The Quantum Fourier Transform (QFT) is a key component of many important quantum algorithms, most famously as being the essential ingredient in Shor's algorithm for factoring products of primes. Given its remarkable capability, one would…
We explore the connection between the area law for entanglement and geometry by representing the entanglement entropies corresponding to all $2^N$ bipartitions of an $N$-party pure quantum system by means of a (generalized) adjacency…
Entanglement is a counterintuitive feature of quantum physics that is at the heart of quantum technology. High-dimensional quantum states offer unique advantages in various quantum information tasks. Integrated photonic chips have recently…
Quantum information protocols often rely on tomographic techniques to determine the state of the system. A popular method of encoding information is on the different paths a photon may take, for example, parallel waveguides in integrated…
The question of which and how a particular class of entangled resource states (known as graph states) can be used for measurement based quantum computation (MBQC) recently gave rise to the notion of Flow and its generalisation gFlow. That…
In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts, are powerful techniques for characterising the dependence of the…
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…
Using the highly detuned interaction between three-level $\Lambda$-type atoms and coherent optical fields, we can realize the C-NOT gates from atoms to atoms, optical fields to optical fields, atoms to optical fields and optical fields to…
We introduce linear-state dataflows, a canonical model for a large set of visualization algorithms that we call data-linear visualizations. Our model defines a fixed dataflow architecture: partitioning and subpartitioning of input data,…
We construct a completely analog framework that emulates universal quantum gates and quantum algorithms. It is based on electronic circuits made of operational amplifiers, resistors and capacitors. In these circuits, input and output lines…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…