Nick S. Jones
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nick S. Jones has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Anders Yeo
Department of Mathematics and Computer Science Department of Mathematics University of Southern Denmark University of Johannesburg
2 shared publications - Arash Rafiey
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK
2 shared publications - Gregory Gutin
Department of Computer Science School of Math- ematical Sciences and LPMC Royal Holloway University of London Nankai University
2 shared publications - Noah Linden
School of Mathematics University of Bristol
2 shared publications - Simone Severini
Department of Computer Science, University College London, London, UK
2 shared publications
Latest Publications
- Open Access
Mediated Digraphs and Quantum Nonlocality
A digraph D=(V,A) is mediated if, for each pair x,y of distinct vertices of D, either xy belongs to A or yx belongs to A or there is a vertex z such that both xz,yz belong to A. For a digraph D, DELTA(D) is the maximum in-degree of a vertex in D. The "nth mediation number" mu(n) is the minimum of DELTA(D) over all mediated digraphs on n vertices. Mediated digraphs and mu(n) are of interest in the study of quantum nonlocality. We obtain a lower bound f(n) for mu(n) and determine infinite sequences of values of n for which mu(n)=f(n) and mu(n)>f(n), respectively. We derive upper bounds for mu(n) and prove that mu(n)=f(n)(1+o(1)). We conjecture that there is a constant c such that mu(n)=<f(n)+c. Methods and results of graph theory, design theory and number theory are used.
Open AccessMediated Digraphs and Quantum Nonlocality
A digraph D=(V,A) is mediated if, for each pair x,y of distinct vertices of D, either xy belongs to A or yx belongs to A or there is a vertex z such that both xz,yz belong to A. For a digraph D, DELTA(D) is the maximum in-degree of a vertex in D. The "nth mediation number" mu(n) is the minimum of DELTA(D) over all mediated digraphs on n vertices. Mediated digraphs and mu(n) are of interest in the study of quantum nonlocality. We obtain a lower bound f(n) for mu(n) and determine infinite sequences of values of n for which mu(n)=f(n) and mu(n)>f(n), respectively. We derive upper bounds for mu(n) and prove that mu(n)=f(n)(1+o(1)). We conjecture that there is a constant c such that mu(n)=<f(n)+c. Methods and results of graph theory, design theory and number theory are used.
- 1 September 2005
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 150 (1-3) , 41-50
Mediated digraphs and quantum nonlocality
- 1 September 2005
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 150 (1-3) , 41-50
Mediated digraphs and quantum nonlocality
- 18 January 2005
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (1) , 012324
Parts of quantum states
It is shown that generic -party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all -party pure states is in the set of reduced states of just over half the parties. For even, the reduced states in fewer than parties are shown to be an insufficient description of almost all states (similar results hold when is odd). It is noted that real algebraic geometry is a natural framework for any analysis of parts of quantum states: two simple polynomials, a quadratic and a cubic, contain all of their structure. Algorithmic techniques are described which can provide conditions for sets of reduced states to belong to pure or mixed states.- 18 January 2005
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (1) , 012324
Parts of quantum states
It is shown that generic -party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all -party pure states is in the set of reduced states of just over half the parties. For even, the reduced states in fewer than parties are shown to be an insufficient description of almost all states (similar results hold when is odd). It is noted that real algebraic geometry is a natural framework for any analysis of parts of quantum states: two simple polynomials, a quadratic and a cubic, contain all of their structure. Algorithmic techniques are described which can provide conditions for sets of reduced states to belong to pure or mixed states.- Open Access
Parts of Quantum States
It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is in the set of reduced states of just over half the parties. For N even, the reduced states in fewer than N/2 parties are shown to be an insufficient description of almost all states (similar results hold when N is odd). It is noted that Real Algebraic Geometry is a natural framework for any analysis of parts of quantum states: two simple polynomials, a quadratic and a cubic, contain all of their structure. Algorithmic techniques are described which can provide conditions for sets of reduced states to belong to pure or mixed states.
Open AccessParts of Quantum States
It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is in the set of reduced states of just over half the parties. For N even, the reduced states in fewer than N/2 parties are shown to be an insufficient description of almost all states (similar results hold when N is odd). It is noted that Real Algebraic Geometry is a natural framework for any analysis of parts of quantum states: two simple polynomials, a quadratic and a cubic, contain all of their structure. Algorithmic techniques are described which can provide conditions for sets of reduced states to belong to pure or mixed states.