Quantum replication at the Heisenberg limit

No process in nature can perfectly clone an arbitrary quantum state. But is it possible to engineer processes that replicate quantum information with vanishingly small error? Here we demonstrate the possibility of probabilistic super-replication phenomena where N equally prepared quantum clocks are transformed into a much larger number of M nearly perfect replicas, with an error that rapidly vanishes whenever M is small compared to the square of N. The quadratic replication rate is the ultimate limit imposed by Quantum Mechanics to the proliferation of information and is fundamentally linked with the Heisenberg limit of quantum metrology.Comment: 9 + 16 pages, 2 figures, published versio

On the Capacity of Secure KK-user Product Computation over a Quantum MAC

Inspired by a recent study by Christensen and Popovski on secure $2$-user product computation for finite-fields of prime-order over a quantum multiple access channel (QMAC), the generalization to $K$ users and arbitrary finite fields is explored. Combining ideas of batch-processing, quantum $2$-sum protocol, a secure computation scheme of Feige, Killian and Naor (FKN), a field-group isomorphism and additive secret sharing, asymptotically optimal (capacity-achieving for large alphabet) schemes are proposed for secure $K$-user (any $K$) product computation over any finite field. The capacity of modulo-$d$ ($d\geq 2$) secure $K$-sum computation over the QMAC is found to be $2/K$ computations/qudit as a byproduct of the analysis

Fiber Optical Tweezers for Applying and Measuring Forces in a 3D Solid Compartment

We developed an inclined dual fiber optical tweezers (DFOTs) for simultaneous force application and measurements in a 3D hydrogel matrix. The inclined DFOTs provide a potential solution for cell mechanics study in a three-dimensional matrix

DiskANN++: Efficient Page-based Search over Isomorphic Mapped Graph Index using Query-sensitivity Entry Vertex

Given a vector dataset $\mathcal{X}$ and a query vector $\vec{x}_q$, graph-based Approximate Nearest Neighbor Search (ANNS) aims to build a graph index $G$ and approximately return vectors with minimum distances to $\vec{x}_q$ by searching over $G$. The main drawback of graph-based ANNS is that a graph index would be too large to fit into the memory especially for a large-scale $\mathcal{X}$. To solve this, a Product Quantization (PQ)-based hybrid method called DiskANN is proposed to store a low-dimensional PQ index in memory and retain a graph index in SSD, thus reducing memory overhead while ensuring a high search accuracy. However, it suffers from two I/O issues that significantly affect the overall efficiency: (1) long routing path from an entry vertex to the query's neighborhood that results in large number of I/O requests and (2) redundant I/O requests during the routing process. We propose an optimized DiskANN++ to overcome above issues. Specifically, for the first issue, we present a query-sensitive entry vertex selection strategy to replace DiskANN's static graph-central entry vertex by a dynamically determined entry vertex that is close to the query. For the second I/O issue, we present an isomorphic mapping on DiskANN's graph index to optimize the SSD layout and propose an asynchronously optimized Pagesearch based on the optimized SSD layout as an alternative to DiskANN's beamsearch. Comprehensive experimental studies on eight real-world datasets demonstrate our DiskANN++'s superiority on efficiency. We achieve a notable 1.5 X to 2.2 X improvement on QPS compared to DiskANN, given the same accuracy constraint.Comment: 15 pages including reference

Predicting Multi-Codebook Vector Quantization Indexes for Knowledge Distillation

Knowledge distillation(KD) is a common approach to improve model performance in automatic speech recognition (ASR), where a student model is trained to imitate the output behaviour of a teacher model. However, traditional KD methods suffer from teacher label storage issue, especially when the training corpora are large. Although on-the-fly teacher label generation tackles this issue, the training speed is significantly slower as the teacher model has to be evaluated every batch. In this paper, we reformulate the generation of teacher label as a codec problem. We propose a novel Multi-codebook Vector Quantization (MVQ) approach that compresses teacher embeddings to codebook indexes (CI). Based on this, a KD training framework (MVQ-KD) is proposed where a student model predicts the CI generated from the embeddings of a self-supervised pre-trained teacher model. Experiments on the LibriSpeech clean-100 hour show that MVQ-KD framework achieves comparable performance as traditional KD methods (l1, l2), while requiring 256 times less storage. When the full LibriSpeech dataset is used, MVQ-KD framework results in 13.8% and 8.2% relative word error rate reductions (WERRs) for non -streaming transducer on test-clean and test-other and 4.0% and 4.9% for streaming transducer. The implementation of this work is already released as a part of the open-source project icefall.Comment: Submitted to ICASSP 202

Optical bulk-boundary dichotomy in a quantum spin Hall insulator

The bulk-boundary correspondence is a key concept in topological quantum materials. For instance, a quantum spin Hall insulator features a bulk insulating gap with gapless helical boundary states protected by the underlying Z2 topology. However, the bulk-boundary dichotomy and distinction are rarely explored in optical experiments, which can provide unique information about topological charge carriers beyond transport and electronic spectroscopy techniques. Here, we utilize mid-infrared absorption micro-spectroscopy and pump-probe micro-spectroscopy to elucidate the bulk-boundary optical responses of Bi4Br4, a recently discovered room-temperature quantum spin Hall insulator. Benefiting from the low energy of infrared photons and the high spatial resolution, we unambiguously resolve a strong absorption from the boundary states while the bulk absorption is suppressed by its insulating gap. Moreover, the boundary absorption exhibits a strong polarization anisotropy, consistent with the one-dimensional nature of the topological boundary states. Our infrared pump-probe microscopy further measures a substantially increased carrier lifetime for the boundary states, which reaches one nanosecond scale. The nanosecond lifetime is about one to two orders longer than that of most topological materials and can be attributed to the linear dispersion nature of the helical boundary states. Our findings demonstrate the optical bulk-boundary dichotomy in a topological material and provide a proof-of-principal methodology for studying topological optoelectronics.Comment: 26 pages, 4 figure

Spatio-temporal divergence in the responses of Finland's boreal forests to climate variables

Spring greening in boreal forest ecosystems has been widely linked to increasing temperature, but few studies have attempted to unravel the relative effects of climate variables such as maximum temperature (TMX), minimum temperature (TMN), mean temperature (TMP), precipitation (PRE) and radiation (RAD) on vegetation growth at different stages of growing season. However, clarifying these effects is fundamental to better understand the relationship between vegetation and climate change. This study investigated spatio-temporal divergence in the responses of Finland's boreal forests to climate variables using the plant phenology index (PPI) calculated based on the latest Collection V006 MODIS BRDF-corrected surface reflectance products (MCD43C4) from 2002 to 2018, and identified the dominant climate variables controlling vegetation change during the growing season (May-September) on a monthly basis. Partial least squares (PLS) regression was used to quantify the response of PPI to climate variables and distinguish the separate impacts of different variables. The study results show the dominant effects of temperature on the PPI in May and June, with TMX, TMN and TMP being the most important explanatory variables for the variation of PPI depending on the location, respectively. Meanwhile, drought had an unexpectedly positive impact on vegetation in few areas. More than 50 % of the variation of PPI could be explained by climate variables for 68.5 % of the entire forest area in May and 87.7 % in June, respectively. During July to September, the PPI variance explained by climate and corresponding spatial extent rapidly decreased. Nevertheless, the RAD was found be the most important explanatory variable to July PPI in some areas. In contrast, the PPI in August and September was insensitive to climate in almost all of the regions studied. Our study gives useful insights on quantifying and identifying the relative importance of climate variables to boreal forest, which can be used to predict the possible response of forest under future warming.Peer reviewe

The CAFA challenge reports improved protein function prediction and new functional annotations for hundreds of genes through experimental screens

Background The Critical Assessment of Functional Annotation (CAFA) is an ongoing, global, community-driven effort to evaluate and improve the computational annotation of protein function. Results Here, we report on the results of the third CAFA challenge, CAFA3, that featured an expanded analysis over the previous CAFA rounds, both in terms of volume of data analyzed and the types of analysis performed. In a novel and major new development, computational predictions and assessment goals drove some of the experimental assays, resulting in new functional annotations for more than 1000 genes. Specifically, we performed experimental whole-genome mutation screening in Candida albicans and Pseudomonas aureginosa genomes, which provided us with genome-wide experimental data for genes associated with biofilm formation and motility. We further performed targeted assays on selected genes in Drosophila melanogaster, which we suspected of being involved in long-term memory. Conclusion We conclude that while predictions of the molecular function and biological process annotations have slightly improved over time, those of the cellular component have not. Term-centric prediction of experimental annotations remains equally challenging; although the performance of the top methods is significantly better than the expectations set by baseline methods in C. albicans and D. melanogaster, it leaves considerable room and need for improvement. Finally, we report that the CAFA community now involves a broad range of participants with expertise in bioinformatics, biological experimentation, biocuration, and bio-ontologies, working together to improve functional annotation, computational function prediction, and our ability to manage big data in the era of large experimental screens.Peer reviewe