相关论文: Graphical rule of transforming continuous-variable…
Graph states are the backbone of measurement-based continuous-variable quantum computation. However, experimental realisations of these states induce Gaussian measurement statistics for the field quadratures, which poses a barrier to obtain…
The measurement based, or one-way, model of quantum computation for continuous variables uses a highly entangled state called a cluster state to accomplish the task of computing. Cluster states that are universal for computation are a…
Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a…
Single layer graphene foils produced by Chemical Vapor Deposition (CVD) are rolled with self-positioned layers of InGaAs/Cr forming compact multi-turn tubular structures that consist on successive graphene/metal/semiconductor…
The phase of a single-mode field can be measured in a single-shot measurement by interfering the field with an effectively classical local oscillator of known phase. The standard technique is to have the local oscillator detuned from the…
The purity of graphene samples is of crucial importance for their experimental and practical use. In this regard, the detection of the defects is of direct relevance. Here, we show that structural defects in graphene samples give rise to…
With the increased complexity of power systems due to the integration of smart grid technologies and renewable energy resources, more frequent changes have been introduced to system status, and the traditional serial mode of state…
Enhanced sampling simulations make the computational study of rare events feasible. A large family of such methods crucially depends on the definition of some collective variables (CVs) that could provide a low-dimensional representation of…
A picture P of a graph G = (V,E) consists of a point P(v) for each vertex v in V and a line P(e) for each edge e in E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A…
The paper presents a new model for single channel images low-level interpretation. The image is decomposed into a graph which captures a complete set of structural features. The description allows to accurately identify every edge location…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
We developed a method of precise isotope labeling to visualize the continuous growth of graphene by chemical vapor deposition (CVD). This method allows us to see in real time the growth of graphene monocrystals at a resolution of a few…
Cartoon-texture image decomposition is a critical preprocessing problem bottlenecked by the numerical intractability of classical variational or optimization models and the tedious manual tuning of global regularization parameters.We…
Although gravitational waves are now routinely observed, the detection of individual gravitons has long been regarded as impossible. Recent work, however, has demonstrated that single-graviton detection can be achieved and may be feasible…
The graphicality problem -- whether or not a sequence of integers can be used to create a simple graph -- is a key question in network theory and combinatorics, with many important practical applications. In this work, we study the…
We study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. A homomorphism from edge-coloured graph $G$ to edge-coloured graph $H$ is a vertex-mapping from $G$ to…
Incorporating graphs in the analysis of multivariate signals is becoming a standard way to understand the interdependency of activity recorded at different sites. The new research frontier in this direction includes the important problem of…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…