Gaussian boson sampling is an alternative model for demonstrating quantum computational supremacy,where squeezed states are injected into every input mode, instead of applying single photons as in the case of standard...Gaussian boson sampling is an alternative model for demonstrating quantum computational supremacy,where squeezed states are injected into every input mode, instead of applying single photons as in the case of standard boson sampling. Here by analyzing numerically the computational costs, we establish a lower bound for achieving quantum computational supremacy for a class of Gaussian bosonsampling problems. Specifically, we propose a more efficient method for calculating the transition probabilities, leading to a significant reduction of the simulation costs. Particularly, our numerical results indicate that one can simulate up to 18 photons for Gaussian boson sampling at the output subspace on a normal laptop, 20 photons on a commercial workstation with 256 cores, and about 30 photons for supercomputers. These numbers are significantly smaller than those in standard boson sampling, suggesting that Gaussian boson sampling could be experimentally-friendly for demonstrating quantum computational supremacy.展开更多
The notion of the identity-based(id-based) strong designate verifier signature(SDVS) was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis dele...The notion of the identity-based(id-based) strong designate verifier signature(SDVS) was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis delegation technical in fixed dimension. The proposed scheme is based on the hardness of the learning with errors(LWE) problem, and the unforgeability against adaptive chosen message and selective identity attack is based on the hardness of the short integer solution(SIS) problem in the random oracle model. If the parameters m, n and q are the same, the signature length of this scheme is only 3mlbq bits shorter than(3m+n) lb q bits which is the signature length of the known lattice-based SDVS scheme in the public key environment. As a result, the proposed scheme is not only id-based but also efficient about the signature length and the computation cost. Moreover, this article also proposed an id-based strong designate verifier ring signature(SDVRS) scheme based on the proposed SDVS scheme, which satisfies anonimity, unforgeability.展开更多
Rapid estimation of post-earthquake building damage and loss is very important in urgent response efforts.The current approach leaves much room for improvement in estimating ground motion and correctly incorporating t...Rapid estimation of post-earthquake building damage and loss is very important in urgent response efforts.The current approach leaves much room for improvement in estimating ground motion and correctly incorporating the uncertainty and spatial correlation of the loss.This study proposed a new approach for rapidly estimating post-earthquake building loss with reasonable accuracy.The proposed method interpolates ground motion based on the observed ground motion using the Ground Motion Prediction Equation(GMPE)as the weight.It samples the building seismic loss quantile considering the spatial loss correlation that is expressed by Gaussian copula,and kriging is applied to reduce the dimension of direct sampling for estimation speed.The proposed approach was validated using three historical earthquake events in Japan with actual loss reports,and was then applied to predict the building loss amount for the March 2022 Fukushima Mw7.3 earthquake.The proposed method has high potential in future emergency efforts such as search,rescue,and evacuation planning.展开更多
基金supported by the Guangdong Innovative and Entrepreneurial Research Team Program (2016ZT06D348)Natural Science Foundation of Guangdong Province (2017B030308003)+6 种基金the Key R&D Program of Guangdong Province (2018B030326001)the Science, Technology and Innovation Commission of Shenzhen Municipality (JCYJ20170412152620376, JCYJ20170817105046702 and KYTDPT20181011104202253)the National Natural Science Foundation of China (11875160 and U1801661)supported by the National Natural Science Foundation of China (61832003, 61872334)the Economy, Trade and Information Commission of Shenzhen Municipality (201901161512)the Strategic Priority Research Program of Chinese Academy of Sciences (XDB28000000)K. C. Wong Education Foundation
文摘Gaussian boson sampling is an alternative model for demonstrating quantum computational supremacy,where squeezed states are injected into every input mode, instead of applying single photons as in the case of standard boson sampling. Here by analyzing numerically the computational costs, we establish a lower bound for achieving quantum computational supremacy for a class of Gaussian bosonsampling problems. Specifically, we propose a more efficient method for calculating the transition probabilities, leading to a significant reduction of the simulation costs. Particularly, our numerical results indicate that one can simulate up to 18 photons for Gaussian boson sampling at the output subspace on a normal laptop, 20 photons on a commercial workstation with 256 cores, and about 30 photons for supercomputers. These numbers are significantly smaller than those in standard boson sampling, suggesting that Gaussian boson sampling could be experimentally-friendly for demonstrating quantum computational supremacy.
基金supported by the National Natural Science Foundation of China (61303198)Natural Science Foundation of Shandong Province (ZR2013FQ031)supported by the Doctor Foundation of Shandong Jianzhu University
文摘The notion of the identity-based(id-based) strong designate verifier signature(SDVS) was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis delegation technical in fixed dimension. The proposed scheme is based on the hardness of the learning with errors(LWE) problem, and the unforgeability against adaptive chosen message and selective identity attack is based on the hardness of the short integer solution(SIS) problem in the random oracle model. If the parameters m, n and q are the same, the signature length of this scheme is only 3mlbq bits shorter than(3m+n) lb q bits which is the signature length of the known lattice-based SDVS scheme in the public key environment. As a result, the proposed scheme is not only id-based but also efficient about the signature length and the computation cost. Moreover, this article also proposed an id-based strong designate verifier ring signature(SDVRS) scheme based on the proposed SDVS scheme, which satisfies anonimity, unforgeability.
基金supported by the Scientific Research Fund of the Institute of Engineering Mechanics,China Earthquake Administration(Grant No.2021B09)the National Natural Science Foundation of China(Grant No.51978634)。
文摘Rapid estimation of post-earthquake building damage and loss is very important in urgent response efforts.The current approach leaves much room for improvement in estimating ground motion and correctly incorporating the uncertainty and spatial correlation of the loss.This study proposed a new approach for rapidly estimating post-earthquake building loss with reasonable accuracy.The proposed method interpolates ground motion based on the observed ground motion using the Ground Motion Prediction Equation(GMPE)as the weight.It samples the building seismic loss quantile considering the spatial loss correlation that is expressed by Gaussian copula,and kriging is applied to reduce the dimension of direct sampling for estimation speed.The proposed approach was validated using three historical earthquake events in Japan with actual loss reports,and was then applied to predict the building loss amount for the March 2022 Fukushima Mw7.3 earthquake.The proposed method has high potential in future emergency efforts such as search,rescue,and evacuation planning.