Fast Quantum Algorithm for Solving Multivariate Quadratic Equations

In August 2015 the cryptographic world was shaken by a sudden and surprising announcement by the US National Security Agency NSA concerning plans to transition to post-quantum algorithms. Since this announcement post-quantum cryptography has become a topic of primary interest for several standardization bodies. The transition from the currently deployed public-key algorithms to post-quantum algorithms has been found to be challenging in many aspects. In particular the problem of evaluating the quantum-bit security of such post-quantum cryptosystems remains vastly open. Of course this question is of primarily concern in the process of standardizing the post-quantum cryptosystems. In this paper we consider the quantum security of the problem of solving a system of {\it $m$ Boolean multivariate quadratic equations in $n$ variables} (\MQb); a central problem in post-quantum cryptography. When $n=m$, under a natural algebraic assumption, we present a Las-Vegas quantum algorithm solving \MQb{} that requires the evaluation of, on average, $O(2^{0.462n})$ quantum gates. To our knowledge this is the fastest algorithm for solving \MQb{}

YAP and TAZ Mediate Osteocyte Perilacunar/Canalicular Remodeling

Bone fragility fractures are caused by low bone mass or impaired bone quality. Osteoblast/osteoclast coordination determines bone mass, but the factors that control bone quality are poorly understood. Osteocytes regulate osteoblast and osteoclast activity on bone surfaces but can also directly reorganize the bone matrix to improve bone quality through perilacunar/canalicular remodeling; however, the molecular mechanisms remain unclear. We previously found that deleting the transcriptional regulators Yes-associated protein (YAP) and Transcriptional co-activator with PDZ-motif (TAZ) from osteoblast-lineage cells caused lethality in mice due to skeletal fragility. Here, we tested the hypothesis that YAP and TAZ regulate osteocyte-mediated bone remodeling by conditional ablation of both YAP and TAZ from mouse osteocytes using 8kb-DMP1-Cre. Osteocyte-conditional YAP/TAZ deletion reduced bone mass and dysregulated matrix collagen content and organization, which together decreased bone mechanical properties. Further, YAP/TAZ deletion impaired osteocyte perilacunar/canalicular remodeling by reducing canalicular network density, length, and branching, as well as perilacunar flourochrome-labeled mineral deposition. Consistent with recent studies identifying TGF-β as a key inducer of osteocyte expression of matrix-remodeling enzymes, YAP/TAZ deletion in vivo decreased osteocyte expression of matrix proteases MMP13, MMP14, and CTSK. In vitro, pharmacologic inhibition of YAP/TAZ transcriptional activity in osteocyte-like cells abrogated TGF-β-induced matrix protease gene expression. Together, these data show that YAP and TAZ control bone matrix accrual, organization, and mechanical properties by regulating osteocyte-mediated bone remodeling. Elucidating the signaling pathways that control perilacunar/canalicular remodeling may enable future therapeutic targeting of bone quality to reverse skeletal fragility

SNAPSHOT USA 2019 : a coordinated national camera trap survey of the United States

This article is protected by copyright. All rights reserved.With the accelerating pace of global change, it is imperative that we obtain rapid inventories of the status and distribution of wildlife for ecological inferences and conservation planning. To address this challenge, we launched the SNAPSHOT USA project, a collaborative survey of terrestrial wildlife populations using camera traps across the United States. For our first annual survey, we compiled data across all 50 states during a 14-week period (17 August - 24 November of 2019). We sampled wildlife at 1509 camera trap sites from 110 camera trap arrays covering 12 different ecoregions across four development zones. This effort resulted in 166,036 unique detections of 83 species of mammals and 17 species of birds. All images were processed through the Smithsonian's eMammal camera trap data repository and included an expert review phase to ensure taxonomic accuracy of data, resulting in each picture being reviewed at least twice. The results represent a timely and standardized camera trap survey of the USA. All of the 2019 survey data are made available herein. We are currently repeating surveys in fall 2020, opening up the opportunity to other institutions and cooperators to expand coverage of all the urban-wild gradients and ecophysiographic regions of the country. Future data will be available as the database is updated at eMammal.si.edu/snapshot-usa, as well as future data paper submissions. These data will be useful for local and macroecological research including the examination of community assembly, effects of environmental and anthropogenic landscape variables, effects of fragmentation and extinction debt dynamics, as well as species-specific population dynamics and conservation action plans. There are no copyright restrictions; please cite this paper when using the data for publication.Publisher PDFPeer reviewe

Fast Quantum Algorithm for Solving Multivariate Quadratic Equations

In August 2015 the cryptographic world was shaken by a sudden and surprising announcement by the US National Security Agency NSA concerning plans to transition to post-quantum algorithms. Since this announcement post-quantum cryptography has become a topic of primary interest for several standardization bodies. The transition from the currently deployed public-key algorithms to post-quantum algorithms has been found to be challenging in many aspects. In particular the problem of evaluating the quantum-bit security of such post-quantum cryptosystems remains vastly open. Of course this question is of primarily concern in the process of standardizing the post-quantum cryptosystems. In this paper we consider the quantum security of the problem of solving a system of {\it $m$ Boolean multivariate quadratic equations in $n$ variables} (\MQb); a central problem in post-quantum cryptography. When $n=m$, under a natural algebraic assumption, we present a Las-Vegas quantum algorithm solving \MQb{} that requires the evaluation of, on average, $O(2^{0.462n})$ quantum gates. To our knowledge this is the fastest algorithm for solving \MQb{}