Capacity estimation and verification of quantum channels with arbitrarily correlated errors

© 2017 The Author(s). The central figure of merit for quantum memories and quantum communication devices is their capacity to store and transmit quantum information. Here, we present a protocol that estimates a lower bound on a channel's quantum capacity, even when there are arbitrarily correlated errors. One application of these protocols is to test the performance of quantum repeaters for transmitting quantum information. Our protocol is easy to implement and comes in two versions. The first estimates the one-shot quantum capacity by preparing and measuring in two different bases, where all involved qubits are used as test qubits. The second verifies on-the-fly that a channel's one-shot quantum capacity exceeds a minimal tolerated value while storing or communicating data. We discuss the performance using simple examples, such as the dephasing channel for which our method is asymptotically optimal. Finally, we apply our method to a superconducting qubit in experiment

Comparative flower transcriptome network analysis reveals DEGs involved in chickpea reproductive success during salinity

Salinity is increasingly becoming a significant problem for the most important yet intrinsically salt-sensitive grain legume chickpea. Chickpea is extremely sensitive to salinity during the reproductive phase. Therefore, it is essential to understand the molecular mechanisms by comparing the transcriptomic dynamics between the two contrasting genotypes in response to salt stress. Chickpea exhibits considerable genetic variation amongst improved cultivars, which show better yields in saline conditions but still need to be enhanced for sustainable crop production. Based on previous extensive multi-location physiological screening, two identified genotypes, JG11 (salt-tolerant) and ICCV2 (salt-sensitive), were subjected to salt stress to evaluate their phenological and transcriptional responses. RNA-Sequencing is a revolutionary tool that allows for comprehensive transcriptome profiling to identify genes and alleles associated with stress tolerance and sensitivity. After the first flowering, the whole flower from stress-tolerant and sensitive genotypes was collected. A total of ~300 million RNA-Seq reads were sequenced, resulting in 2022 differentially expressed genes (DEGs) in response to salt stress. Genes involved in flowering time such as FLOWERING LOCUS T (FT) and pollen development such as ABORTED MICROSPORES (AMS), rho-GTPase, and pollen-receptor kinase were significantly differentially regulated, suggesting their role in salt tolerance. In addition to this, we identify a suite of essential genes such as MYB proteins, MADS-box, and chloride ion channel genes, which are crucial regulators of transcriptional responses to salinity tolerance. The gene set enrichment analysis and functional annotation of these genes in flower development suggest that they can be potential candidates for chickpea crop improvement for salt tolerance

Tactile defensiveness and impaired adaptation of neuronal activity in the Fmr1 knockout mouse model of autism

Sensory hypersensitivity is a common symptom in autism spectrum disorders (ASDs), including Fragile X Syndrome (FXS), and frequently leads to tactile defensiveness. In mouse models of ASDs, there is mounting evidence of neuronal and circuit hyperexcitability in several brain regions, which could contribute to sensory hypersensitivity. However, it is not yet known whether or how sensory stimulation might trigger abnormal sensory processing at the circuit level or abnormal behavioral responses in ASD mouse models, especially during an early developmental time when experience-dependent plasticity shapes such circuits. Using a novel assay, we discovered exaggerated motor responses to whisker stimulation in young Fmr1 knockout (KO) mice (postnatal days (P) 14-16), a model of FXS. Adult Fmr1 KO mice actively avoided a stimulus that was innocuous to wild-type controls, a sign of tactile defensiveness. Using in vivo two-photon calcium imaging of Layer 2/3 barrel cortex neurons expressing GCaMP6s, we found no differences between wild-type and Fmr1 KO mice in overall whisker-evoked activity, though 45% fewer neurons in young Fmr1 KO mice responded in a time-locked manner. Notably, we identified a pronounced deficit in neuronal adaptation to repetitive whisker stimulation in both young and adult Fmr1 KO mice. Thus, impaired adaptation in cortical sensory circuits is a potential cause of tactile defensiveness in autism

Geoelectrical response of a water bearing sandstone shale sequence and estimation of sand shale ratio

An attempt has been made to use the geoelectrical response of a water bearing sandstone-shale sequence to estimate the sandstone-shale ratio. In all, 168 sandstone-shale sequence models were generated using Monte-Carlo simulation technique. The resistivity transform and its autocorrelation function of all the models were calculated. The amplitude, phase, power and log spectra Were also extracted. The power spectrum appears to hold promise in estimating the sand stone-shale ratio of these models because the power amplitude P2 shows a high negative correlation with sandstone shale ratio values

Lattice-Based Quantum Advantage from Rotated Measurements

Trapdoor claw-free functions (TCFs) are immensely valuable in cryptographic interactions between a classical client and a quantum server. Typically, a protocol has the quantum server prepare a superposition of two-bit strings of a claw and then measure it using Pauli-$X$ or $Z$ measurements. In this paper, we demonstrate a new technique that uses the entire range of qubit measurements from the $XY$-plane. We show the advantage of this approach in two applications. First, building on (Brakerski et al. 2018, Kalai et al. 2022), we show an optimized two-round proof of quantumness whose security can be expressed directly in terms of the hardness of the LWE (learning with errors) problem. Second, we construct a one-round protocol for blind remote preparation of an arbitrary state on the $XY$-plane up to a Pauli-$Z$ correction

Composable security of delegated quantum computation

Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power. For delegated computation protocols to be usable in a larger context---or simply to securely run two protocols in parallel---the security definitions need to be composable. Here, we define composable security for delegated quantum computation. We distinguish between protocols which provide only blindness---the computation is hidden from the server---and those that are also verifiable---the client can check that it has received the correct result. We show that the composable security definition capturing both these notions can be reduced to a combination of several distinct "trace-distance-type" criteria---which are, individually, non-composable security definitions. Additionally, we study the security of some known delegated quantum computation protocols, including Broadbent, Fitzsimons and Kashefi's Universal Blind Quantum Computation protocol. Even though these protocols were originally proposed with insufficient security criteria, they turn out to still be secure given the stronger composable definitions.Comment: 37+9 pages, 13 figures. v3: minor changes, new references. v2: extended the reduction between composable and local security to include entangled inputs, substantially rewritten the introduction to the Abstract Cryptography (AC) framewor

Security Limitations of Classical-Client Delegated Quantum Computing

Secure delegated quantum computing allows a computationally weak client to outsource an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. One of the promising candidates to achieve classical delegation of quantum computation is classical-client remote state preparation ($RSP_{CC}$), where a client remotely prepares a quantum state using a classical channel. However, the privacy loss incurred by employing $RSP_{CC}$ as a sub-module is unclear. In this work, we investigate this question using the Constructive Cryptography framework by Maurer and Renner (ICS'11). We first identify the goal of $RSP_{CC}$ as the construction of ideal RSP resources from classical channels and then reveal the security limitations of using $RSP_{CC}$. First, we uncover a fundamental relationship between constructing ideal RSP resources (from classical channels) and the task of cloning quantum states. Any classically constructed ideal RSP resource must leak to the server the full classical description (possibly in an encoded form) of the generated quantum state, even if we target computational security only. As a consequence, we find that the realization of common RSP resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem. Second, the above result does not rule out that a specific $RSP_{CC}$ protocol can replace the quantum channel at least in some contexts, such as the Universal Blind Quantum Computing (UBQC) protocol of Broadbent et al. (FOCS '09). However, we show that the resulting UBQC protocol cannot maintain its proven composable security as soon as $RSP_{CC}$ is used as a subroutine. Third, we show that replacing the quantum channel of the above UBQC protocol by the $RSP_{CC}$ protocol QFactory of Cojocaru et al. (Asiacrypt '19), preserves the weaker, game-based, security of UBQC.Comment: 40 pages, 12 figure

Verifiable blind quantum computing with trapped ions and single photons

We report the first hybrid matter-photon implementation of verifiable blind quantum computing. We use a trapped-ion quantum server and a client-side photonic detection system networked via a fiber-optic quantum link. The availability of memory qubits and deterministic entangling gates enables interactive protocols without postselection—key requirements for any scalable blind server, which previous realizations could not provide. We quantify the privacy at ≲0.03 leaked classical bits per qubit. This experiment demonstrates a path to fully verified quantum computing in the cloud