Filters








136,493 Hits in 7.6 sec

Page 750 of Mathematical Reviews Vol. , Issue 2001B [page]

2001 Mathematical Reviews  
“Since the length and the dimension of a 7 -indistinguishability operator are related to its generation via max-7 and via the representation theorem, respectively, betweenness relations are an ideal tool  ...  2001b:03056 length of the operator and on its dimension.  ... 

Dynamical indistinguishability and statistics in quantum fluids [article]

Alessio Zaccone, Kostya Trachenko
2021 arXiv   pre-print
We subsequently propose a quantitative criterion of particle indistinguishability and associated quantum statistics to be inoperative at short time and emerge at long time.  ...  Here, we address the hitherto unexplored dynamical condition for the quantum-statistical effects to be manifested, and consider particle exchange events in the gaslike regime of fluid dynamics as a dynamical  ...  In future work it could be interesting to find a possible relation between τ x above related to quantum indistinguishability and related interference terms in (2) and the interpretation of τ Pl as the  ... 
arXiv:2107.09995v2 fatcat:fve7f5xut5dw7m5y7uf6jdkqme

Cryptographic distinguishability measures for quantum-mechanical states

C.A. Fuchs, J. van de Graaf
1999 IEEE Transactions on Information Theory  
In another vein, these measures and their connecting inequalities are used to define a single notion of cryptographic exponential indistinguishability for two families of quantum states.  ...  We obtain several inequalities that relate the quantum distinguishability measures to each other, one of which may be crucial for proving the security of quantum cryptographic key distribution.  ...  Mor for helping us realize the usefulness of these results. Special thanks are also due M. Boyer and C. Crépeau.  ... 
doi:10.1109/18.761271 fatcat:i6lsoakf4vfn7jnafmi6bnu3ki

Computational Soundness, Co-induction, and Encryption Cycles [chapter]

Daniele Micciancio
2010 Lecture Notes in Computer Science  
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic expressions.  ...  The aim of this paper is to explore one specific aspect that sets the symbolic and computational models apart, and that has not received much attention so far: the use of induction versus co-induction  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1007/978-3-642-13190-5_19 fatcat:tcrphmlq4ffjtp34sf7hznsdd4

A study on the relationship between relaxed metrics and indistinguishability operators

Pilar Fuster-Parra, Javier Martin, Juan José Miñana, Óscar Valero
2019 Zenodo  
Trillas introduced the notion of indistinguishability operator with the main aim of fuzzifying the crisp notion of equivalence relation.  ...  In the study of such a class of operators, an outstanding property must be stressed. Concretely, there exists a duality relationship between indistinguishability operators and metrics.  ...  Acknowledgements The authors are very grateful to the reviewers for their valuable suggestions which have helped to improve the content of the paper.  ... 
doi:10.5281/zenodo.4967197 fatcat:vuhj7ftxw5hqjid534e5awpxwi

A computational interpretation of Dolev–Yao adversaries

Jonathan Herzog
2005 Theoretical Computer Science  
The Dolev-Yao model is a simple and useful framework in which to analyze security protocols, but it assumes that the adversary is extremely limited.  ...  We do this in a number of steps: (1) The Dolev-Yao model places strong assumptions on the adversary.  ...  Acknowledgements A previous, and weaker, form of this paper appeared as part of [10] .  ... 
doi:10.1016/j.tcs.2005.03.003 fatcat:2aar2iezibhf7esrnsvqezkb74

Using Partial Sensor Information to Orient Parts

Srinivas Akella, Matthew T. Mason
1999 The international journal of robotics research  
Bowl feeders rely on a sequence of mechanical operations and typically do not use sensors.  ...  We characterize the shorter execution lengths of sensor-based plans and show that sensor-based plans are more powerful than sensorless plans in that they can bring a larger class of parts to distinct orientations  ...  Acknowledgments Funding was provided by NSF under grants IRI-9213993 and IRI-9318496 (with ARPA). Additional support for Srinivas Akella was provided by the Beckman Institute.  ... 
doi:10.1177/02783649922067663 fatcat:pnchhkwmknfnlcrbqijcyuxsoi

The Impact of the Spectral Filter Bandwidth on the Spectral Entanglement and Indistinguishability of Photon Pairs of SPDC Process

Ali Mohammadi, Atoosa Sadat Arabanian, Ali Dalafi, Laser and Plasma Research Institute, Laser and Plasma Research Institute, Laser and Plasma Research Institute
2018 International Journal of Optics and Photonics  
First, we derive the eigenvalue equation of reduced density operator of the signal and the idler photons in terms of the bandwidth of spectral filters.  ...  The amount of the spectral entanglement and the indistinguishability of photon pairs are the two critical characteristics of the photon pairs determining their potential applications.  ...  That is why the value of I (Δt=0) is considered as the amount of spectral indistinguishability between the signal and idler photons [10] .  ... 
doi:10.29252/ijop.12.2.119 fatcat:lpyeovmc3zhh5mwrjjkipwodxq

Totally destructive interference for permutation-symmetric many-particle states

Christoph Dittel, Gabriel Dufour, Mattia Walschaers, Gregor Weihs, Andreas Buchleitner, Robert Keil
2018 Physical Review A  
with forbidden single-particle transitions, show how all suppression laws hitherto known can be retrieved from our general formalism, and discuss striking differences between bosons and fermions.  ...  Several distinct classes of unitary mode transformations have been known to exhibit the strict suppression of a large set of transmission events, as a consequence of totally destructive many-particle interference  ...  Our notation does not discern between bosonic and fermionic creation operators in the following.  ... 
doi:10.1103/physreva.97.062116 fatcat:wnv4aypxmvbqxmmlhqyhr2lzn4

Partial-indistinguishability obfuscation using braids [article]

Gorjan Alagic, Stacey Jeffery, Stephen P. Jordan
2012 arXiv   pre-print
Recent works have proposed the first efficient obfuscation algorithms for classical logic circuits, based on a notion of indistinguishability against polynomial-time adversaries.  ...  In this work, we propose a new notion of obfuscation, which we call partial-indistinguishability.  ...  We also thank Mariano Suárez-Alvarez and Gjergji Zaimi for leading us to reference [11] via math.stackexchange and mathoverflow.  ... 
arXiv:1212.6458v1 fatcat:j2v54zd7pbg27b2qx64w56nsla

Boson sampling with photons of arbitrary spectral structure

Peter P. Rohde
2015 Physical Review A. Atomic, Molecular, and Optical Physics  
Here we consider the operation of boson-sampling with photons of arbitrary spectral structure and relate the sampling statistics of the device to matrix permanents.  ...  This sheds light on the computational complexity of different regimes of the photons' spectral characteristics, and provides very general results for the operation of linear optics interferometers in the  ...  We refer the reader to Ref. [15] for details of their approach. We thank Bill Munro, Timothy Ralph and Barry Sanders for helpful discussions.  ... 
doi:10.1103/physreva.91.012307 fatcat:g3327vp67fhwfbb2goeiqmec5u

Conditioning by Minimizing Accessibility [chapter]

Konstantinos Georgatos
2010 Lecture Notes in Computer Science  
This paper presents an axiomatization of a class of set-theoretic conditional operators using minimization of the geodesic distance defined as the shortest path generated by the accessibility relation  ...  The objective of this modeling is to define conditioning based on a notion of similarity generated by degrees of indistinguishability.  ...  This means there is a (n − 1)-length sequence of R-related elements between x, x .  ... 
doi:10.1007/978-3-642-15164-4_2 fatcat:pj5tsouf6zhfffzjlx6uyno23i

Cryptographic Distinguishability Measures for Quantum Mechanical States [article]

Christopher A. Fuchs, Jeroen van de Graaf
1998 arXiv   pre-print
In another vein, these measures and their connecting inequalities are used to define a single notion of cryptographic exponential indistinguishability for two families of quantum states.  ...  We obtain several inequalities that relate the quantum distinguishability measures to each other, one of which may be crucial for proving the security of quantum cryptographic key distribution.  ...  Giving an answer to this question is the subject of this paper. That is, we shall be concerned with defining and relating various notions of "distance" between two quantum states.  ... 
arXiv:quant-ph/9712042v2 fatcat:zg4e2gdiljhyfhwr2xz5tywmfa

Can single crystal X-ray diffraction determine a structure uniquely? [article]

Yihan Shen, Yibin Jiang, Jianhua Lin, Cheng Wang, Junliang Sun
2020 arXiv   pre-print
The diffraction technique is widely used in the determination of crystal structures and is one of the bases for the modern science and technology.  ...  All related structure determination methods are based on the assumption that perfect single crystal X-ray diffraction (SXRD) can determine a structure uniquely.  ...  The a and b-coordinates for all atoms are 0, 0.25, 0.5 or 0.75 with the c-coordinates zero. The lengths of axes are a=10 Å and c=6.37 Å. (b) The P, Q and R parts of the structure.  ... 
arXiv:2008.10008v1 fatcat:rzva3ibjrvckrdpyfj7qdra62e

Sequential generation of linear cluster states from a single photon emitter [article]

D. Istrati, Y. Pilnyak, J. C. Loredo, C. Antón, N. Somaschi, P. Hilaire, H. Ollivier, M. Esmann, L. Cohen, L.Vidro, C. Millet, A. Lemaître, I. Sagnes (+4 others)
2020 arXiv   pre-print
The reported architecture can be programmed to generate linear-cluster states of any number of photons with record scaling ratios, potentially enabling practical implementation of photonic quantum computing  ...  Light states composed of multiple entangled photons - such as cluster states - are essential for developing and scaling-up quantum computing networks.  ...  In Imperfect photon indistinguishability M limits the entanglement length, defined as the longest possible linear cluster state such that positive concurrence is found between the first and last photons  ... 
arXiv:1912.04375v2 fatcat:76mosfma7fchfbarxbqsm35vju
« Previous Showing results 1 — 15 out of 136,493 results