computing scheme
Recently Published Documents


TOTAL DOCUMENTS

101
(FIVE YEARS 39)

H-INDEX

10
(FIVE YEARS 3)

Author(s):  
Marta Sroczyńska ◽  
Anna Dawid ◽  
Michał Tomza ◽  
Zbigniew Idziaszek ◽  
Tommaso Calarco ◽  
...  

Abstract Ultracold molecules trapped in optical tweezers show great promise for the implementation of quantum technologies and precision measurements. We study a prototypical scenario where two interacting polar molecules placed in separate traps are controlled using an external electric field. This, for instance, enables a quantum computing scheme in which the rotational structure is used to encode the qubit states. We estimate the typical operation timescales needed for state engineering to be in the range of few microseconds. We further underline the important role of the spatial structure of the two-body states, with the potential for significant gate speedup employing trap-induced resonances.


MAUSAM ◽  
2021 ◽  
Vol 47 (1) ◽  
pp. 67-72
Author(s):  
A K. SEN SARMA

Having established that the figure of 300,000 quoted as the human casualty in the legendary south of 1737 was a implant (Sen Sarma 1994) and the simultaneous earthquake a myth (Sen Sarma 1993, Bilham, 1994) it was necessary to freshly evaluate that storm as to its severity and destructive impact. The strength of0 storm was assessed  by using  the reported surge of 40 ft as the output  in Ghosh’s (1977)  surge computing scheme and arriving  at the required input    p. The probable track of the storm was reconstructed with the help of an analogue. The likely area inundated by 'significant' surge was demarcated by analogy with 1970 Bangladesh storm (Frank and Husain 1971). The affected population of that area was estimated from the decadal figures for Bengal area going backward from recent times to 1801, Finally, the number of lives lost was inferred from the available data on the mortality ratio in the Andhra cyclone of 1977. It is estimated that the cyclone of 17.37 was a T 7 storm and had taken 35,000 lives (the error margin being 10,000 on either side of that figure).


2021 ◽  
Author(s):  
Yan Zhao ◽  
Ning Hu ◽  
Yue Zhao ◽  
Zhihan Zhu

Author(s):  
Zerui Chen ◽  
Youliang Tian ◽  
Jinbo Xiong ◽  
Changgen Peng ◽  
Jianfeng Ma

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Tao Feng ◽  
Xusheng Wang ◽  
Chunyan Liu ◽  
Junli Fang

With the rapid development of information technology, different organizations cooperate with each other to share data information and make full use of data value. Not only should the integrity and privacy of data be guaranteed but also the collaborative computing should be carried out on the basis of data sharing. In this paper, in order to achieve the fairness of data security sharing and collaborative computing, a security data collaborative computing scheme based on blockchain is proposed. A data storage query model based on Bloom filter is designed to improve the efficiency of data query sharing. The MPC contract is designed according to the specific requirements. The participants are rational, and the contract encourages the participants to implement the agreement honestly to achieve fair calculation. A secure multiparty computation based on secret sharing is introduced. The problem of identity and vote privacy in electronic voting is solved. The scheme is analyzed and discussed from storage expansion, anticollusion, verifiability, and privacy.


Sign in / Sign up

Export Citation Format

Share Document