This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theor...This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theory, some new conditions for the nonlinear Lurie multi-agent systems reaching bipartite leaderless consensus and bipartite tracking consensus are presented. Compared with the traditional methods, this approach degrades the dimensions of the conditions, eliminates some restrictions of the system matrix, and extends the range of the nonlinear function. Finally, two numerical examples are provided to illustrate the efficiency of our results.展开更多
Let G be a bipartite graph with vertex set V(G) and edge set E(G), and let g and f be two positive integer-valued functions defined on V(G) such that g(x) ≤ f(x) for every vertex x of V(G). Then a (g, f)-factor of G ...Let G be a bipartite graph with vertex set V(G) and edge set E(G), and let g and f be two positive integer-valued functions defined on V(G) such that g(x) ≤ f(x) for every vertex x of V(G). Then a (g, f)-factor of G is a spanning subgraph H of G such that g(x) ≤ dH(x) 5 f(x) for each x ∈ V(H). A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {F1, F2,…… ， Fm } and H be a factorization and a subgraph of G, respectively. If F, 1 ≤ i ≤ m， has exactly one edge in common with H, then it is said that ■ is orthogonal to H. It is proved that every bipartite (mg + m - 1, mf - m + 1 )-graph G has a (g, f)-factorization orthogonal to k vertex disjoint m-subgraphs of G if 2-k ≤ g(x) for all x ∈ V(G). Furthermore, it is showed that the results in this paper are best possible.展开更多
Quantum correlations in a family of bipartite separable qubit-qutrit quantum-classical correlated states are investigated by using two popular measures,i.e.,the original quantum discord(OQD)method by Ollivier and Zure...Quantum correlations in a family of bipartite separable qubit-qutrit quantum-classical correlated states are investigated by using two popular measures,i.e.,the original quantum discord(OQD)method by Ollivier and Zurek[Phys.Rev.Lett.88(2001)017901]and the measurement-induced disturbance(MID)method by Luo[Phys.Rev.A 77(2008)022301].It is found that both of them are functions of a parameter partially characterizing the concerned states,however,quantum correlations evaluated via the convenient MID method are somewhat overestimated.展开更多
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of verte...Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.展开更多
In this paper the authors generalize the classic random bipartite graph model, and define a model of the random bipartite multigraphs as follows：let m = m（n） be a positive integer-valued function on n and ζ（n,m;{...In this paper the authors generalize the classic random bipartite graph model, and define a model of the random bipartite multigraphs as follows：let m = m（n） be a positive integer-valued function on n and ζ（n,m;{pk}） the probability space consisting of all the labeled bipartite multigraphs with two vertex sets A ={a_1,a_2,...,a_n} and B = {b_1,b_2,...,b_m}, in which the numbers t_（ai）,b_j of the edges between any two vertices a_i∈A and b_j∈ B are identically distributed independent random variables with distribution P{t_（ai）,b_j=k}=pk,k=0,1,2,...,where pk ≥0 and ∞Σk=0 pk=1. They obtain that X_（c,d,A）, the number of vertices in A with degree between c and d of G_（n,m）∈ζ（n, m;{pk}） has asymptotically Poisson distribution, and answer the following two questions about the space ζ（n,m;{pk}） with {pk} having geometric distribution, binomial distribution and Poisson distribution, respectively. Under which condition for {pk} can there be a function D（n） such that almost every random multigraph G_（n,m）∈ζ（n,m;{pk}） has maximum degree D（n）in A？ under which condition for {pk} has almost every multigraph G（n,m）∈ζ（n,m;{pk}） a unique vertex of maximum degree in A？展开更多
A new bipartite coherent-entangled state is introduced in the two-mode Fock space, which exhibits the properties of both a coherent state and an entangled state. The set of coherent-entangled states makes up a complet...A new bipartite coherent-entangled state is introduced in the two-mode Fock space, which exhibits the properties of both a coherent state and an entangled state. The set of coherent-entangled states makes up a complete and partly nonorthogonal representation. A simple experimental scheme to produce the coherent-entangled state using an asymmetric beamsplitter is proposed. Some applications of the coherent-entangled state in quantum optics are also oresented.展开更多
The first problem considered in this article reads： is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs？ It is proved that ther...The first problem considered in this article reads： is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs？ It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n3/2, where n is the number of vertices. The second problem is to estimate spanning tree congestion of random graphs. It is proved that the standard model of random graphs cannot be used to find graphs whose spanning tree congestion has order greater than n3/2.展开更多
Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtour...Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtournament. Let t ( m, n, k, l ) = max{t( Tm,n，k, l ) : Tm,n∈Γm，n^*}, where t ( Tm,n, k, l ) is the number of k × l(k≥2,l≥2) transitive bipartite subtournaments contained in Tm,n∈Γm，n^*. We obtain a method of graph theory for solving some integral programmings, investigate the upper bounds of a(m,n) and obtain t (m,n, k，l).展开更多
In this paper,we propose a new approach to tackle the separability problem for bipartite qudit mixed-states.This is based on the Majorana representation which allows to represent a N-spinors(qudit)as a symmetric state...In this paper,we propose a new approach to tackle the separability problem for bipartite qudit mixed-states.This is based on the Majorana representation which allows to represent a N-spinors(qudit)as a symmetric state of N spin-1/2.We also discuss how we can exploit such representation and the notion of the biseparability of multipartite qubit states in the sense to establish new criteria of the separability problem based on the PPT and concurrence.展开更多
In this paper the structure of neighborhood complex of a bipartite graph is discussed, the concept of dusl complex is introduced, the main result that a pair of dual complexes is exactly the neighborhood complex or a ...In this paper the structure of neighborhood complex of a bipartite graph is discussed, the concept of dusl complex is introduced, the main result that a pair of dual complexes is exactly the neighborhood complex or a connected bipartite graph is proved.展开更多
Projection is a widely used method in bipartite networks. However, each projection has a specific application scenario and differs in the forms of mapping for bipartite networks. In this paper, inspired by the network...Projection is a widely used method in bipartite networks. However, each projection has a specific application scenario and differs in the forms of mapping for bipartite networks. In this paper, inspired by the network-based information exchange dynamics, we propose a uniform framework of projection. Subsequently, an information exchange rate projection based on the nature of community structures of a network （named IERCP） is designed to detect community structures of bipartite networks. Results from the synthetic and real-world networks show that the IERCP algorithm has higher performance compared with the other projection methods. It suggests that the IERCP may extract more information hidden in bipartite networks and minimize information loss.展开更多
We construct a new bipartite entangled state（NBES）,which describes both the squeezing and the entanglement involved in the parametric down-conversion process and can be produced using a symmetric beam splitter.Const...We construct a new bipartite entangled state（NBES）,which describes both the squeezing and the entanglement involved in the parametric down-conversion process and can be produced using a symmetric beam splitter.Constructing asymmetric ket-bra integrations based on the NBES leads to some new squeezing operators,which clearly exhibit the relationships between squeezing and entangled state transformations.Moreover,an entangled Wigner operator with a definite physical meaning is also presented.展开更多
This paper investigates bipartite entanglement of a two-qubit system with anisotropic couplings under an inhomogeneous magnetic field. This work is mainly to investigate the characteristics of a Heisenberg XYZ chain a...This paper investigates bipartite entanglement of a two-qubit system with anisotropic couplings under an inhomogeneous magnetic field. This work is mainly to investigate the characteristics of a Heisenberg XYZ chain and obtains some meaningful results. By the concept of negativity, it finds that the inhomogeneity of magnetic field may induce entanglement and the critical magnetic field is independent of Jz. The inhomogeneous magnetic field can increase the value of critical magnetic field Bc. It also finds that the magnetic field not only suppresses the entanglement but also can induce it to revival for some time.展开更多
Quantum coherence is the most distinct feature of quantum mechanics.However,inevitable decoherence processes will finally destroy it and make the"Schrödinger's cat"invisible in our classical world.I...Quantum coherence is the most distinct feature of quantum mechanics.However,inevitable decoherence processes will finally destroy it and make the"Schrödinger's cat"invisible in our classical world.In this"quantum-to-classical transition",the so-called"largeness"plays a critical role.We experimentally study the largeness phenomena in the bipartite entanglement decay process through a depolarizing channel with two-photon entangled states generated from a spontaneous parametric down-conversion source.Our experiment demonstrates how the speed of entanglement decay and the time when"entanglement sudden death"happens depend on the size of the system exposed to the environment noise.展开更多
A density matrix is usually obtained by solving the Bloch equation, however only a few Hamiltonians＇ density matrices can be analytically derived. The density matrix for two interacting particles with kinetic couplin...A density matrix is usually obtained by solving the Bloch equation, however only a few Hamiltonians＇ density matrices can be analytically derived. The density matrix for two interacting particles with kinetic coupling is hard to derive by the usual method due to this coupling; this paper solves this problem by using the bipartite entangled state representation.展开更多
Purpose： This study aims to answer the question to what extent different types of networks can be used to predict future co-authorship among authors.Design/methodology/approach： We compare three types ot networks： ...Purpose： This study aims to answer the question to what extent different types of networks can be used to predict future co-authorship among authors.Design/methodology/approach： We compare three types ot networks： unwelgntea networks, in which a link represents a past collaboration; weighted networks, in which links are weighted by the number of joint publications; and bipartite author-publication networks. The analysis investigates their relation to positive stability, as well as their potential in predicting links in future versions of the co-authorship network. Several hypotheses are tested.Findings： Among other results, we find that weighted networks do not automatically lead to better predictions. Bipartite networks, however, outperform unweighted networks in almost all cases. Research limitations： Only two relatively small case studies are considered Practical implications： The study suggests that future link prediction studies on networks should consider using the bipartite network as a training network. Originality/value： This is the first systematic comparison of unweighted, weighted, and bipartite training networks in link prediction.展开更多
The Wiener index W（G） of a graph G is defined as the sum of distances between all pairs of vertices of the graph, Let G＊c, is the set of the complements of bipartite graphs with order n. In this paper, we character...The Wiener index W（G） of a graph G is defined as the sum of distances between all pairs of vertices of the graph, Let G＊c, is the set of the complements of bipartite graphs with order n. In this paper, we characterize the graphs with the maximum and second-maximum Wiener indices among all the graphs in G＊c, respectively.展开更多
We propose a pilot domain non-orthogonal multiple access(NOMA)for uplink massive devices grant-free random access scenarios in massive multiple-input multiple-output(MIMO)maritime communication systems.These scenarios...We propose a pilot domain non-orthogonal multiple access(NOMA)for uplink massive devices grant-free random access scenarios in massive multiple-input multiple-output(MIMO)maritime communication systems.These scenarios are characterized by numerous devices with sporadic access behavior,and therefore only a subset of them are active.Due to massive potential devices in the network,it is infeasible to assign a unique orthogonal pilot to each device in advance.In such scenarios,pilot decontamination is a crucial problem.In this paper,the devices are randomly assigned non-orthogonal pilots which are constructed by a linear combination of some orthogonal pilots.We show that a bipartite graph can conveniently describe the interference cancellation(IC)processes of pilot decontamination.High spectrum efficiency(SE)and low outage probability can be obtained by selecting the numbers of orthogonal pilots according to the given probability distribution.Numerical evaluatioDs show that the proposed pilot domain NOMA decreases the outage probability from 20%to 2 e-12 at the SE of 4 bits/s/Hz for a single device,compared to the conventional method of slotted ALOHA with 1024 antennas at the BS,or increases the spectrum efficiency from 1.2 bits/s/Hz to 4 bit/s/Hz at the outage probability of2 e-12 in contrast with the Welch bound equality(WBE)non-orthogonal pilots.展开更多
High-dimensional(HD)entanglement provides a very promising way of transcending the limitations of the twodimensional entanglement between qubits for increasing channel capacity in many quantum protocols.In the pursuit...High-dimensional(HD)entanglement provides a very promising way of transcending the limitations of the twodimensional entanglement between qubits for increasing channel capacity in many quantum protocols.In the pursuit of capitalizing on the HD entangled states,one of the central issues is to unambiguously and comprehensively quantilfy and reconstruct them.The full quantum state tomography is a unique solution,but it is undesirable and even impractical because the measurements increase rapidly in d^4 for a bipartite d-dimensional quantum state.Here we present a very efficient and practical tomography method—asymptotical locking tomography(ALT),which can harvest full information of bipartite d-dimensional entangled states by very few measurements less than 2 d^2 only.To showcase the validity and reasonableness of our ALT,we carry out the test with the two-photon spin-orbital angular momentum hyperentangled states in a four-dimensional subspace.Besides high-efficiency and practicality,our ALT is also universal and can be generalized into multipartite HD entanglement and other quantum systems.展开更多
Conventional power systems are being developed into grid cyber physical systems(GCPS) with widespread application of communication, computer, and control technologies. In this article, we propose a quantitative analys...Conventional power systems are being developed into grid cyber physical systems(GCPS) with widespread application of communication, computer, and control technologies. In this article, we propose a quantitative analysis method for a GCPS. Based on this, we discuss the relationship between cyberspace and physical space, especially the computational similarity within the GCPS both in undirected and directed bipartite networks. We then propose a model for evaluating the fusion of the three most important factors: information, communication, and security. We then present the concept of the fusion evaluation cubic for the GCPS quantitative analysis model. Through these models, we can determine whether a more realistic state of the GCPS can be found by enhancing the fusion between cyberspace and physical space. Finally, we conclude that the degree of fusion between the two spaces is very important, not only considering the performance of the whole business process, but also considering security.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant No.62363005)the Jiangxi Provincial Natural Science Foundation(Grant Nos.20161BAB212032 and 20232BAB202034)the Science and Technology Research Project of Jiangxi Provincial Department of Education(Grant Nos.GJJ202602 and GJJ202601)。
文摘This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theory, some new conditions for the nonlinear Lurie multi-agent systems reaching bipartite leaderless consensus and bipartite tracking consensus are presented. Compared with the traditional methods, this approach degrades the dimensions of the conditions, eliminates some restrictions of the system matrix, and extends the range of the nonlinear function. Finally, two numerical examples are provided to illustrate the efficiency of our results.
基金This work was supported by NNSF. RFDP and NNSF of shandong province(Z2000A02 ).
文摘Let G be a bipartite graph with vertex set V(G) and edge set E(G), and let g and f be two positive integer-valued functions defined on V(G) such that g(x) ≤ f(x) for every vertex x of V(G). Then a (g, f)-factor of G is a spanning subgraph H of G such that g(x) ≤ dH(x) 5 f(x) for each x ∈ V(H). A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {F1, F2,…… ， Fm } and H be a factorization and a subgraph of G, respectively. If F, 1 ≤ i ≤ m， has exactly one edge in common with H, then it is said that ■ is orthogonal to H. It is proved that every bipartite (mg + m - 1, mf - m + 1 )-graph G has a (g, f)-factorization orthogonal to k vertex disjoint m-subgraphs of G if 2-k ≤ g(x) for all x ∈ V(G). Furthermore, it is showed that the results in this paper are best possible.
基金Supported by the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No 20103401110007the National Natural Science Foundation of China under Grant Nos 10874122,10975001,51072002 and 51272003+1 种基金the Program for Excellent Talents at the University of Guangdong Province(Guangdong Teacher Letter[1010]No 79)the 211 Project of Anhui University.
文摘Quantum correlations in a family of bipartite separable qubit-qutrit quantum-classical correlated states are investigated by using two popular measures,i.e.,the original quantum discord(OQD)method by Ollivier and Zurek[Phys.Rev.Lett.88(2001)017901]and the measurement-induced disturbance(MID)method by Luo[Phys.Rev.A 77(2008)022301].It is found that both of them are functions of a parameter partially characterizing the concerned states,however,quantum correlations evaluated via the convenient MID method are somewhat overestimated.
基金Supported by the National Natural Science Foundation of China（61163037, 61163054, 11261046, 61363060）
文摘Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.
文摘In this paper the authors generalize the classic random bipartite graph model, and define a model of the random bipartite multigraphs as follows：let m = m（n） be a positive integer-valued function on n and ζ（n,m;{pk}） the probability space consisting of all the labeled bipartite multigraphs with two vertex sets A ={a_1,a_2,...,a_n} and B = {b_1,b_2,...,b_m}, in which the numbers t_（ai）,b_j of the edges between any two vertices a_i∈A and b_j∈ B are identically distributed independent random variables with distribution P{t_（ai）,b_j=k}=pk,k=0,1,2,...,where pk ≥0 and ∞Σk=0 pk=1. They obtain that X_（c,d,A）, the number of vertices in A with degree between c and d of G_（n,m）∈ζ（n, m;{pk}） has asymptotically Poisson distribution, and answer the following two questions about the space ζ（n,m;{pk}） with {pk} having geometric distribution, binomial distribution and Poisson distribution, respectively. Under which condition for {pk} can there be a function D（n） such that almost every random multigraph G_（n,m）∈ζ（n,m;{pk}） has maximum degree D（n）in A？ under which condition for {pk} has almost every multigraph G（n,m）∈ζ（n,m;{pk}） a unique vertex of maximum degree in A？
基金Project supported by the National Natural Science Foundation of China (Grant No. 11147009)the Natural Science Foundation of Shandong Province, China (Grant No. ZR2010AQ027)the Shandong Provincial Higher Educational Science and Technology Program, China (Grant No. J09LA07)
文摘A new bipartite coherent-entangled state is introduced in the two-mode Fock space, which exhibits the properties of both a coherent state and an entangled state. The set of coherent-entangled states makes up a complete and partly nonorthogonal representation. A simple experimental scheme to produce the coherent-entangled state using an asymmetric beamsplitter is proposed. Some applications of the coherent-entangled state in quantum optics are also oresented.
文摘The first problem considered in this article reads： is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs？ It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n3/2, where n is the number of vertices. The second problem is to estimate spanning tree congestion of random graphs. It is proved that the standard model of random graphs cannot be used to find graphs whose spanning tree congestion has order greater than n3/2.
文摘Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtournament. Let t ( m, n, k, l ) = max{t( Tm,n，k, l ) : Tm,n∈Γm，n^*}, where t ( Tm,n, k, l ) is the number of k × l(k≥2,l≥2) transitive bipartite subtournaments contained in Tm,n∈Γm，n^*. We obtain a method of graph theory for solving some integral programmings, investigate the upper bounds of a(m,n) and obtain t (m,n, k，l).
文摘In this paper,we propose a new approach to tackle the separability problem for bipartite qudit mixed-states.This is based on the Majorana representation which allows to represent a N-spinors(qudit)as a symmetric state of N spin-1/2.We also discuss how we can exploit such representation and the notion of the biseparability of multipartite qubit states in the sense to establish new criteria of the separability problem based on the PPT and concurrence.
文摘In this paper the structure of neighborhood complex of a bipartite graph is discussed, the concept of dusl complex is introduced, the main result that a pair of dual complexes is exactly the neighborhood complex or a connected bipartite graph is proved.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11505114 and 10975099)the Program for Professor of Special Appointment(Orientational Scholar)at Shanghai Institutions of Higher Learning(Grant Nos.QD02015016 and DUSST02)+1 种基金the Shanghai Project for Construction of Discipline Peaks,the Natural Science Foundation of Guangxi Zhuang Guangxi Zhuang Autonomous Region(Grant No.2016GXNSFDA380031)the Fundamental Ability Enhancement Project for Young and Middle-aged University Teachers in Guangxi Zhuang Autonomous Region(Grant No.2017KY0859)
文摘Projection is a widely used method in bipartite networks. However, each projection has a specific application scenario and differs in the forms of mapping for bipartite networks. In this paper, inspired by the network-based information exchange dynamics, we propose a uniform framework of projection. Subsequently, an information exchange rate projection based on the nature of community structures of a network （named IERCP） is designed to detect community structures of bipartite networks. Results from the synthetic and real-world networks show that the IERCP algorithm has higher performance compared with the other projection methods. It suggests that the IERCP may extract more information hidden in bipartite networks and minimize information loss.
基金Project supported by the National Natural Science Foundation of China (Grant No. 11147009)the Natural Science Foundation of Shandong Province,China (Grant Nos. ZR2010AQ027 and ZR2012AM004)the Shandong Provincial Higher Educational Science and Technology Program,China (Grant No. J10LA15)
文摘We construct a new bipartite entangled state（NBES）,which describes both the squeezing and the entanglement involved in the parametric down-conversion process and can be produced using a symmetric beam splitter.Constructing asymmetric ket-bra integrations based on the NBES leads to some new squeezing operators,which clearly exhibit the relationships between squeezing and entangled state transformations.Moreover,an entangled Wigner operator with a definite physical meaning is also presented.
文摘This paper investigates bipartite entanglement of a two-qubit system with anisotropic couplings under an inhomogeneous magnetic field. This work is mainly to investigate the characteristics of a Heisenberg XYZ chain and obtains some meaningful results. By the concept of negativity, it finds that the inhomogeneity of magnetic field may induce entanglement and the critical magnetic field is independent of Jz. The inhomogeneous magnetic field can increase the value of critical magnetic field Bc. It also finds that the magnetic field not only suppresses the entanglement but also can induce it to revival for some time.
基金by the National Basic Research Program of China under Grant No 2011CB921200the National Natural Science Foundation of China under Grant Nos 11074242 and 10874162+3 种基金the Knowledge Innovation Project of Chinese Academy of Sciencesthe Program for New Century Excellent Talents in Universitythe International Cooperation Program from CAS and the Ministry of Science and Technology of Chinathe Foundation for the Author of National Excellent Doctoral Dissertation of of China under Grant No 200729.
文摘Quantum coherence is the most distinct feature of quantum mechanics.However,inevitable decoherence processes will finally destroy it and make the"Schrödinger's cat"invisible in our classical world.In this"quantum-to-classical transition",the so-called"largeness"plays a critical role.We experimentally study the largeness phenomena in the bipartite entanglement decay process through a depolarizing channel with two-photon entangled states generated from a spontaneous parametric down-conversion source.Our experiment demonstrates how the speed of entanglement decay and the time when"entanglement sudden death"happens depend on the size of the system exposed to the environment noise.
文摘A density matrix is usually obtained by solving the Bloch equation, however only a few Hamiltonians＇ density matrices can be analytically derived. The density matrix for two interacting particles with kinetic coupling is hard to derive by the usual method due to this coupling; this paper solves this problem by using the bipartite entangled state representation.
文摘Purpose： This study aims to answer the question to what extent different types of networks can be used to predict future co-authorship among authors.Design/methodology/approach： We compare three types ot networks： unwelgntea networks, in which a link represents a past collaboration; weighted networks, in which links are weighted by the number of joint publications; and bipartite author-publication networks. The analysis investigates their relation to positive stability, as well as their potential in predicting links in future versions of the co-authorship network. Several hypotheses are tested.Findings： Among other results, we find that weighted networks do not automatically lead to better predictions. Bipartite networks, however, outperform unweighted networks in almost all cases. Research limitations： Only two relatively small case studies are considered Practical implications： The study suggests that future link prediction studies on networks should consider using the bipartite network as a training network. Originality/value： This is the first systematic comparison of unweighted, weighted, and bipartite training networks in link prediction.
文摘The Wiener index W（G） of a graph G is defined as the sum of distances between all pairs of vertices of the graph, Let G＊c, is the set of the complements of bipartite graphs with order n. In this paper, we characterize the graphs with the maximum and second-maximum Wiener indices among all the graphs in G＊c, respectively.
基金supported by Key R&D Program of China under Grant 2018YFB1801102National Natural Science Foundation of China(U1736108)+1 种基金Foundation for Innovative Research Groups of the National Natural Science Foundation of China(61621091)Tsinghua University Initiative Scientific Research Program 20193080005。
文摘We propose a pilot domain non-orthogonal multiple access(NOMA)for uplink massive devices grant-free random access scenarios in massive multiple-input multiple-output(MIMO)maritime communication systems.These scenarios are characterized by numerous devices with sporadic access behavior,and therefore only a subset of them are active.Due to massive potential devices in the network,it is infeasible to assign a unique orthogonal pilot to each device in advance.In such scenarios,pilot decontamination is a crucial problem.In this paper,the devices are randomly assigned non-orthogonal pilots which are constructed by a linear combination of some orthogonal pilots.We show that a bipartite graph can conveniently describe the interference cancellation(IC)processes of pilot decontamination.High spectrum efficiency(SE)and low outage probability can be obtained by selecting the numbers of orthogonal pilots according to the given probability distribution.Numerical evaluatioDs show that the proposed pilot domain NOMA decreases the outage probability from 20%to 2 e-12 at the SE of 4 bits/s/Hz for a single device,compared to the conventional method of slotted ALOHA with 1024 antennas at the BS,or increases the spectrum efficiency from 1.2 bits/s/Hz to 4 bit/s/Hz at the outage probability of2 e-12 in contrast with the Welch bound equality(WBE)non-orthogonal pilots.
基金Supported by the National Key R&D Program of China under Grant Nos.2017YFA0303800 and 2017YFA0303700the National Natural Science Foundation of China under Grant Nos.11534006,91750202,11774183 and 11674184the Collaborative Innovation Center of Extreme Optics。
文摘High-dimensional(HD)entanglement provides a very promising way of transcending the limitations of the twodimensional entanglement between qubits for increasing channel capacity in many quantum protocols.In the pursuit of capitalizing on the HD entangled states,one of the central issues is to unambiguously and comprehensively quantilfy and reconstruct them.The full quantum state tomography is a unique solution,but it is undesirable and even impractical because the measurements increase rapidly in d^4 for a bipartite d-dimensional quantum state.Here we present a very efficient and practical tomography method—asymptotical locking tomography(ALT),which can harvest full information of bipartite d-dimensional entangled states by very few measurements less than 2 d^2 only.To showcase the validity and reasonableness of our ALT,we carry out the test with the two-photon spin-orbital angular momentum hyperentangled states in a four-dimensional subspace.Besides high-efficiency and practicality,our ALT is also universal and can be generalized into multipartite HD entanglement and other quantum systems.
基金supported by The National Key Research and Development Program of China (Title: Basic Theories and Methods of Analysis and Control of the Cyber Physical Systems for Power Grid (Basic Research Class 2017YFB0903000))the State Grid Science and Technology Project (Title: Research on Architecture and Several Key Technologies for Grid Cyber Physical System,No.SGRIXTKJ[2016]454)
文摘Conventional power systems are being developed into grid cyber physical systems(GCPS) with widespread application of communication, computer, and control technologies. In this article, we propose a quantitative analysis method for a GCPS. Based on this, we discuss the relationship between cyberspace and physical space, especially the computational similarity within the GCPS both in undirected and directed bipartite networks. We then propose a model for evaluating the fusion of the three most important factors: information, communication, and security. We then present the concept of the fusion evaluation cubic for the GCPS quantitative analysis model. Through these models, we can determine whether a more realistic state of the GCPS can be found by enhancing the fusion between cyberspace and physical space. Finally, we conclude that the degree of fusion between the two spaces is very important, not only considering the performance of the whole business process, but also considering security.
