Direct observation of non-classical photon statistics in parametric downconversion

We employ a high quantum efficiency photon number counter to determine the photon number distribution of the output field from a parametric downconverter. The raw photocount data directly demonstrates that the source is nonclassical by forty standard deviations, and correcting for the quantum efficiency yields a direct observation of oscillations in the photon number distribution

Demonstration of Einstein-Podolsky-Rosen Steering Using Hybrid Continuous- and Discrete-Variable Entanglement of Light

Einstein-Podolsky-Rosen steering is known to be a key resource for one-sided device-independent quantum information protocols. Here we demonstrate steering using hybrid entanglement between continuous- and discrete-variable optical qubits. To this end, we report on suitable steering inequalities and detail the implementation and requirements for this demonstration. Steering is experimentally certified by observing a violation by more than 5 standard deviations. Our results illustrate the potential of optical hybrid entanglement for applications in heterogeneous quantum networks that would interconnect disparate physical platforms and encodings

Performance of various quantum key distribution systems using 1.55 um up-conversion single-photon detectors

We compare the performance of various quantum key distribution (QKD) systems using a novel single-photon detector, which combines frequency up-conversion in a periodically poled lithium niobate (PPLN) waveguide and a silicon avalanche photodiode (APD). The comparison is based on the secure communication rate as a function of distance for three QKD protocols: the Bennett-Brassard 1984 (BB84), the Bennett, Brassard, and Mermin 1992 (BBM92), and the coherent differential phase shift keying (DPSK). We show that the up-conversion detector allows for higher communication rates and longer communication distances than the commonly used InGaAs/InP APD for all the three QKD protocols.Comment: 9 pages, 9 figure

Multipartite entanglement verification resistant against dishonest parties

Future quantum information networks will likely consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and hence it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this work, we show how an agent of a quantum network can perform a distributed verification of a multipartite entangled source with minimal resources, which is, nevertheless, resistant against any number of dishonest parties. Moreover, we provide a tight tradeoff between the level of security and the distance between the state produced by the source and the ideal maximally entangled state. Last, by adding the resource of a trusted common random source, we can further provide security guarantees for all honest parties in the quantum network simultaneously.Comment: The statement of Theorem 2 has been revised and a new proof is given. Other results unchange

Photon counting schemes and performance of non-deterministic nonlinear gates in linear optics

The performance of nondeterministic nonlinear gates in linear optics relies on the photon counting scheme being employed and the efficiencies of the detectors in such schemes. We assess the performance of the nonlinear sign gate, which is a critical component of linear optical quantum computing, for two standard photon counting methods: the double detector array and the visible light photon counter. Our analysis shows that the double detector array is insufficient to provide the photon counting capability for effective nondeterministic nonlinear transformations, and we determine the gate fidelity for both photon counting methods as a function of detector efficiencies

Analysis of Elliptically Polarized Maximally Entangled States for Bell Inequality Tests

When elliptically polarized maximally entangled states are considered, i.e., states having a non random phase factor between the two bipartite polarization components, the standard settings used for optimal violation of Bell inequalities are no longer adapted. One way to retrieve the maximal amount of violation is to compensate for this phase while keeping the standard Bell inequality analysis settings. We propose in this paper a general theoretical approach that allows determining and adjusting the phase of elliptically polarized maximally entangled states in order to optimize the violation of Bell inequalities. The formalism is also applied to several suggested experimental phase compensation schemes. In order to emphasize the simplicity and relevance of our approach, we also describe an experimental implementation using a standard Soleil-Babinet phase compensator. This device is employed to correct the phase that appears in the maximally entangled state generated from a type-II nonlinear photon-pair source after the photons are created and distributed over fiber channels.Comment: 8 page

Quantum Communication

Quantum communication, and indeed quantum information in general, has changed the way we think about quantum physics. In 1984 and 1991, the first protocol for quantum cryptography and the first application of quantum non-locality, respectively, attracted a diverse field of researchers in theoretical and experimental physics, mathematics and computer science. Since then we have seen a fundamental shift in how we understand information when it is encoded in quantum systems. We review the current state of research and future directions in this new field of science with special emphasis on quantum key distribution and quantum networks.Comment: Submitted version, 8 pg (2 cols) 5 fig

Combined burden and functional impact tests for cancer driver discovery using DriverPower

The discovery of driver mutations is one of the key motivations for cancer genome sequencing. Here, as part of the ICGC/TCGA Pan-Cancer Analysis of Whole Genomes (PCAWG) Consortium, which aggregated whole genome sequencing data from 2658 cancers across 38 tumour types, we describe DriverPower, a software package that uses mutational burden and functional impact evidence to identify driver mutations in coding and non-coding sites within cancer whole genomes. Using a total of 1373 genomic features derived from public sources, DriverPower's background mutation model explains up to 93% of the regional variance in the mutation rate across multiple tumour types. By incorporating functional impact scores, we are able to further increase the accuracy of driver discovery. Testing across a collection of 2583 cancer genomes from the PCAWG project, DriverPower identifies 217 coding and 95 non-coding driver candidates. Comparing to six published methods used by the PCAWG Drivers and Functional Interpretation Working Group, DriverPower has the highest F1 score for both coding and non-coding driver discovery. This demonstrates that DriverPower is an effective framework for computational driver discovery

Experimental verification of multipartite entanglement in quantum networks

Multipartite entangled states are a fundamental resource for a wide range of quantum information processing tasks. In particular, in quantum networks it is essential for the parties involved to be able to verify if entanglement is present before they carry out a given distributed task. Here we design and experimentally demonstrate a protocol that allows any party in a network to check if a source is distributing a genuinely multipartite entangled state, even in the presence of untrusted parties. The protocol remains secure against dishonest behaviour of the source and other parties, including the use of system imperfections to their advantage. We demonstrate the verification protocol in a three- and four-party setting using polarization-entangled photons, highlighting its potential for realistic photonic quantum communication and networking applications.Comment: 8 pages, 4 figure

MREdictor: a two-step dynamic interaction model that accounts for mRNA accessibility and Pumilio binding accurately predicts microRNA targets.

The prediction of pairing between microRNAs (miRNAs) and the miRNA recognition elements (MREs) on mRNAs is expected to be an important tool for understanding gene regulation. Here, we show that mRNAs that contain Pumilio recognition elements (PRE) in the proximity of predicted miRNA-binding sites are more likely to form stable secondary structures within their 3′-UTR, and we demonstrated using a PUM1 and PUM2 double knockdown that Pumilio proteins are general regulators of miRNA accessibility. On the basis of these findings, we developed a computational method for predicting miRNA targets that accounts for the presence of PRE in the proximity of seed-match sequences within poorly accessible structures. Moreover, we implement the miRNA-MRE duplex pairing as a two-step model, which better fits the available structural data. This algorithm, called MREdictor, allows for the identification of miRNA targets in poorly accessible regions and is not restricted to a perfect seed-match; these features are not present in other computational prediction methods