相关论文: Extended Quantum Color Coding
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum…
We introduce the domain wall color code, a new variant of the quantum error-correcting color code that exhibits exceptionally high code-capacity error thresholds for qubits subject to biased noise. In the infinite bias regime, a…
We extend the prepare-and-measure frequency-time coding quantum key distribution(FT-QKD) protocol to an entanglement based FT-QKD protocol. The latter can be implemented with a correlated frequency measurement scheme based on a time…
We prove that for every $d\in \mathbb{N}$ and a graph class of bounded expansion $\mathscr{C}$, there exists some $c\in \mathbb{N}$ so that every graph from $\mathscr{C}$ admits a proper coloring with at most $c$ colors satisfying the…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
We formulate a global-position colored-permutation encoding for the capacitated vehicle routing problem. Each of the $K$ vehicles selects a disjoint partial permutation, and the sum of these $K$ color layers forms a full $n\times n$…
In 1970 Hajnal and Szemer\'edi proved a conjecture of Erd\"os that for a graph with maximum degree $\Delta$, there exists an equitable $\Delta+1$ coloring; that is a coloring where color class sizes differ by at most $1$. In 2007 Kierstand…
A packing $k$-coloring is a natural variation on the standard notion of graph $k$-coloring, where vertices are assigned numbers from $\{1, \ldots, k\}$, and any two vertices assigned a common color $c \in \{1, \ldots, k\}$ need to be at a…
In state-of-the-art quantum key distribution (QKD) systems, the main limiting factor in increasing the key generation rate is the timing resolution in detecting photons. Here, we present and experimentally demonstrate a strategy to overcome…
Entanglement represents an important resource for quantum information processing, but its generation itself requires physical resources that are limited. We propose a scheme for generating a wide class of entangled qudit-type states of…
In a three-particle extension of Wheeler's delayed choice gedanken experiment, the quantum statistics of two particles is undetermined until a third particle is measured. As a function of the measurement result, the particles behave either…
Given a graph $G$ with $n$ vertices and maximum degree $\Delta$, it is known that $G$ admits a vertex coloring with $\Delta + 1$ colors such that no edge of $G$ is monochromatic. This can be seen constructively by a simple greedy algorithm,…
Color codes are promising quantum error correction (QEC) codes because they have an advantage over surface codes in that all Clifford gates can be implemented transversally. However, thresholds of color codes under circuit-level noise are…
In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by…
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…
Ray tracing algorithm is a category of rendering algorithms that calculate the color of pixels by simulating the physical movements of a huge amount of rays and calculating their energies, which can be implemented in parallel. Meanwhile,…
The statistical properties of the quantum chaotic spectra have been studied, so far, only up to the second order correlation effects. The numerical as well as the analytical evidence that random matrix theory can successfully model the…
For a fixed integer $q$, the $q$-Coloring problem asks to decide if a given graph has a vertex coloring with $q$ colors such that no two adjacent vertices receive the same color. In a series of papers, it has been shown that for every $q…
A scheme to achieve dense quantum coding for the quadrature amplitudes of the electromagnetic field is presented. The protocol utilizes shared entanglement provided by nondegenerate parametric down conversion in the limit of large gain to…
With the evolution of quantum computing, researchers now-a-days tend to incline to find solutions to NP-complete problems by using quantum algorithms in order to gain asymptotic advantage. In this paper, we solve $k$-coloring problem…