Search

Simulating the real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states’ preparation, discretized time evolution, long-distance entanglement, and measurement in a noisy environment. We implemented an algorithm to simulate the real-time dynamics of a few-qubit system that approximates the Schwinger model in the framework of lattice gauge theories, with specific attention to the occurrence of a dynamical quantum phase transition. Limitations in the simulation capabilities on IBM Quantum were imposed by noise affecting the application of single-qubit and two-qubit gates, which combine in the decomposition of Trotter evolution. The experimental results collected in quantum algorithm runs on IBM Quantum were compared with noise models to characterize the performance in the absence of error mitigation.

One of the big challenges in exoplanet science is to determine the atmospheric makeup of extrasolar planets, and to find biosignatures that hint at the existence of biochemical processes on another world. The biomarkers we are trying to detect are gases in the exoplanet atmosphere like oxygen or methane, which have deep absorption features in the visible and near-infrared spectrum. Here we establish the ultimate quantum limit for determining the presence or absence of a spectral absorption line, for a dim source in the presence of a much brighter stellar source. We characterise the associated error exponent in both the frameworks of symmetric and asymmetric hypothesis testing. We found that a structured measurement based on spatial demultiplexing allows us to decouple the light coming from the planet and achieve the ultimate quantum limits. If the planet has intensity $\epsilon \ll 1$ relative to the star, we show that this approach significantly outperforms direct spectroscopy yielding an improvement of the error exponent by a factor $1/\epsilon$. We find the optimal measurement, which is a combination of interferometric techniques and spectrum analysis., Comment: 9 pages, 5 figures, and appendix; comments are welcome

Emerging communication and cryptography applications call for reliable, fast, unpredictable random number generators. Quantum random number generation (QRNG) allows for the creation of truly unpredictable numbers thanks to the inherent randomness available in quantum mechanics. A popular approach is using the quantum vacuum state to generate random numbers. While convenient, this approach was generally limited in speed compared to other schemes. Here, through custom co-design of opto-electronic integrated circuits and side-information reduction by digital filtering, we experimentally demonstrated an ultrafast generation rate of 100 Gbps, setting a new record for vacuum-based quantum random number generation by one order of magnitude. Furthermore, our experimental demonstrations are well supported by an upgraded device-dependent framework that is secure against both classical and quantum side-information and that also properly considers the non-linearity in the digitization process. This ultrafast secure random number generator in the chip-scale platform holds promise for next generation communication and cryptography applications.

Estimating the angular separation between two incoherent thermal sources is a challenging task for direct imaging, especially when it is smaller than or comparable to the Rayleigh length. In addition, the task of discriminating whether there are one or two sources followed by detecting the faint emission of a secondary source in the proximity of a much brighter one is in itself a severe challenge for direct imaging. Here, we experimentally demonstrate two tasks for superresolution imaging based on quantum state discrimination and quantum imaging techniques. We show that one can significantly reduce the probability of error for detecting the presence of a weak secondary source, especially when the two sources have small angular separations. In this work, we reduce the experimental complexity down to a single two-mode interferometer: we show that (1) this simple set-up is sufficient for the state discrimination task, and (2) if the two sources are of equal brightness, then this measurement can super-resolve their angular separation, saturating the quantum Cram\'er-Rao bound. By using a collection baseline of 5.3~mm, we resolve the angular separation of two sources that are placed 15~$\mu$m apart at a distance of 1.0~m with an accuracy of $1.7\%$--this is between 2 to 3 orders of magnitudes more accurate than shot-noise limited direct imaging., Comment: 17 pages, 16 figures

Coherent states of the quantum electromagnetic field, the quantum description of ideal laser light, are prime candidates as information carriers for optical communications. A large body of literature exists on their quantum-limited estimation and discrimination. However, very little is known about the practical realizations of receivers for unambiguous state discrimination (USD) of coherent states. Here we fill this gap and outline a theory of USD with receivers that are allowed to employ: passive multimode linear optics, phase-space displacements, auxiliary vacuum modes, and on-off photon detection. Our results indicate that, in some regimes, these currently-available optical components are typically sufficient to achieve near-optimal unambiguous discrimination of multiple, multimode coherent states., 20 pages, 13 figures, and 2 tables, including appendices. Accepted version with reference styling for Quantum

A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis and key generation should cater to the number $N$ of the distributed quantum states being finite in practice. Continuous-variable (CV) QKD based on coherent states, despite being a suitable candidate for integration in the telecom infrastructure, has so far been unable to demonstrate composability as existing proofs require a rather large $N$ for successful key generation. Here we report the first Gaussian-modulated coherent state CVQKD system that is able to overcome these challenges and can generate composable keys secure against collective attacks with $N \lesssim 3.5\times10^8$ coherent states. With this advance, possible due to novel improvements to the security proof and a fast, yet low-noise and highly stable system operation, CVQKD implementations take a significant step towards their discrete-variable counterparts in practicality, performance, and security., Comment: 8 pages (including 3 figures and references) + 12 pages supplement

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications. Often, knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here, we experimentally demonstrate five information-theoretically secure anonymity protocols on an eight user city-wide quantum network using polarisation entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping their identity anonymous. For a network of n users, the protocols retain anonymity for the sender, given that no more than n − 2 users are colluding. This is an implementation of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.

Quantum enhanced receivers are endowed with resources to achieve higher sensitivities than conventional technologies. For application in optical communications, they provide improved discriminatory capabilities for multiple non-orthogonal quantum states. In this work, we propose and experimentally demonstrate a new decoding scheme for quadrature phase-shift encoded signals. Our receiver surpasses the standard quantum limit and outperforms all previously known non-adaptive detectors at low input powers. Unlike existing approaches, the receiver only exploits linear optical elements and on-off photo-detection. This circumvents the requirement for challenging feed-forward operations that limit communication transmission rates and can be readily implemented with current technology., 11 pages with 10 figures with appendices. Extended analysis. Accepted version

Continuous-variable quantum key distribution exploits coherent measurements of the electromagnetic field, i.e., homodyne or heterodyne detection. The most advanced security proofs developed so far relied on idealised mathematical models for such measurements, which assume that the measurement outcomes are continuous and unbounded variables. As physical measurement devices have finite range and precision, these mathematical models only serve as an approximation. It is expected that, under suitable conditions, the predictions obtained using these simplified models are in good agreement with the actual experimental implementations. However, a quantitative analysis of the error introduced by this approximation, and of its impact on composable security, have been lacking so far. Here we present a theory to rigorously account for the experimental limitations of realistic heterodyne detection. We focus on collective attacks, and present security proofs for the asymptotic and finite-size regimes, the latter within the framework of composable security. In doing this, we establish for the first time the composable security of discrete-modulation continuous-variable quantum key distribution in the finite-size regime. Tight bounds on the key rates are obtained through semi-definite programming and do not rely on a truncation of the Hilbert space., v3: close to published version

Quantum networks scale the advantages of quantum communication protocols to more than just two distant users. Here we present a fully connected quantum network architecture in which a single entangled photon source distributes quantum states to a multitude of users [1] and our work scaling the network to a complete end to end metropolitan quantum network with 8 users [2] . Our network architecture optimises the resources required by each user without sacrificing security or functionality. We established several long-distance loopback connections and demonstrated extended stable operation with high secure key rates. Unlike previous attempts at multi-user networks, which have been based on active components, and thus limited to some duty cycle, our implementation is fully passive. Further, we present our efforts towards coexistence of 100 Gbps classical communication and all quantum channels used in the network over the same deployed optical fibres.

Quantum data locking is a quantum communication primitive that allows the use of a short secret key to encrypt a much longer message. It guarantees information-theoretical security against an adversary with limited quantum memory. Here we present a quantum data locking protocol that employs pseudo-random circuits consisting of Clifford gates only, which are much easier to implement fault tolerantly than universal gates. We show that information can be encrypted into $n$-qubit code words using order $n - H_\mathrm{min}(\mathsf{X})$ secret bits, where $H_\mathrm{min}(\mathsf{X})$ is the min-entropy of the plain text, and a min-entropy smaller than $n$ accounts for information leakage to the adversary. As an application, we discuss an efficient method for encrypting the output of a quantum computer., Comment: 5 pages, 2 figures, 3 pages appendix

Quantum random number generators promise perfectly unpredictable random numbers. A popular approach to quantum random number generation is homodyne measurements of the vacuum state, the ground state of the electro-magnetic field. Here we experimentally implement such a quantum random number generator, and derive a security proof that considers quantum side-information instead of classical side-information only. Based on the assumptions of Gaussianity and stationarity of noise processes, our security analysis furthermore includes correlations between consecutive measurement outcomes due to finite detection bandwidth, as well as analog-to-digital converter imperfections. We characterize our experimental realization by bounding measured parameters of the stochastic model determining the min-entropy of the system’s measurement outcomes, and we demonstrate a real-time generation rate of 2.9 Gbit/s. Our generator follows a trusted, device-dependent, approach. By treating side-information quantum mechanically an important restriction on adversaries is removed, which usually was reserved to semi-device-independent and device-independent schemes., Security analyses for trusted quantum random number generators usually consider only classical side-information. Here, the authors fill this gap by fully characterising the experimental apparatus of a homodyne-based QRNG, assuming that the vacuum fluctuations and noise are stationary and Gaussian.

Quantum networks have been limited to QKD. Here we present an 8 user quantum network running 5 different anonymity protocols, digital signatures, authentication transfer (sharing initial authentication keys) and flooding (optimally utilization of resources).

Detecting the faint emission of a secondary source in the proximity of the much brighter one has been the most severe obstacle for using direct imaging in searching for exoplanets. Using quantum state discrimination and quantum imaging techniques, we show that one can significantly reduce the probability of error for detecting the presence of a weak secondary source, especially when the two sources have small angular separations. If the weak source has intensity ε≪1 relative to the bright source, we find that the error exponent can be improved by a factor of 1/ε. We also find linear-optical measurements that are optimal in this regime. Our result serves as a complementary method in the toolbox of optical imaging, with applications ranging from astronomy to microscopy.

Symmetry plays a fundamental role in the security analysis of quantum key distribution (QKD). Here we review how symmetry is exploited in continuous-variable (CV) QKD to prove the optimality of Gaussian attacks in the finite-size regime. We then apply these results to improve the efficiency, and thus the key rate, of these protocols. First we show how to improve the efficiency of the energy test, which is one important routine in a CV QKD protocol aimed at establishing an upper bound on the effective dimensions of the otherwise infinite-dimensional Hilbert space of CV systems. Second, we show how the routine of parameter estimation can be made resource efficient in measurement-device independent (MDI) QKD. These results show that all the raw data can be used both for key extraction and for the routines of energy test and parameter estimation., Comment: 14 pages, two figures. V2: close to the published version

The resolution limit of standard imaging techniques is expressed by the Rayleigh criterion, which states that two point-like sources are difficult to resolve if their transverse separation is smaller that the Rayleigh length. While the criterion is useful in the case of direct detection imaging, other measurement techniques may not be subject to this limitation. Here we consider the use of imaging to estimate the distance between two incoherent point sources. In this framework, the Rayleigh criterion manifests itself through the so-called Rayleigh curse. The latter expresses the fact that the statistical error in the estimation increases for sub-wavelength separation. Here we show that, in the regime of weak signals, a structured measurement obtained by concatenating a linear interferometer with on-off photo-detection is immune to the Rayleigh curse. In this way we clarify the relation between imaging and interferometry, and establish the optimality of linear interferometry for an arbitrary number of incoherent sources.

The energy-time uncertainty relation puts a fundamental limit on the precision of radars and lidars for the estimation of range and velocity. The precision in the estimation of the range (through the time of arrival) and the velocity (through Doppler frequency shifts) of a target are inversely related to each other, and dictated by the bandwidth of the signal. Here we use the theoretical toolbox of multi-parameter quantum metrology to determine the ultimate precision of the simultaneous estimation of range and velocity. We consider the case of a single target as well as a pair of closely separated targets. In the latter case, we focus on the relative position and velocity. We show that the trade-off between the estimation precision of position and velocity is relaxed for entangled probe states, and is completely lifted in the limit of infinite entanglement. In the regime where the two targets are close to each other, the relative position and velocity can be estimated nearly optimally and jointly, even without entanglement, using the measurements determined by the symmetric logarithmic derivatives., 9 pages, 5 figures plus appendix

Quantum cryptography is arguably the fastest growing area in quantum information science. Novel theoretical protocols are designed on a regular basis, security proofs are constantly improving, and experiments are gradually moving from proof-of-principle lab demonstrations to in-field implementations and technological prototypes. In this review, we provide both a general introduction and a state of the art description of the recent advances in the field, both theoretically and experimentally. We start by reviewing protocols of quantum key distribution based on discrete variable systems. Next we consider aspects of device independence, satellite challenges, and high rate protocols based on continuous variable systems. We will then discuss the ultimate limits of point-to-point private communications and how quantum repeaters and networks may overcome these restrictions. Finally, we will discuss some aspects of quantum cryptography beyond standard quantum key distribution, including quantum data locking and quantum digital signatures., Comment: Review article. Comments and suggestions are welcome. REVTeX: 118 pages, 20 figures, 785 references

We solve the general problem of determining, through imaging, the three-dimensional positions of N weak incoherent pointlike emitters in an arbitrary spatial configuration. We show that a structured measurement strategy in which a passive linear interferometer feeds into an array of photodetectors is always optimal for this estimation problem, in the sense that it saturates the quantum Cramér-Rao bound. We provide a method for the explicit construction of the optimal interferometer. Further explicit results for the quantum Fisher information and the optimal interferometer design that attains it are obtained for the special case of one and two incoherent emitters in the paraxial regime. This work provides insights into the phenomenon of superresolution through incoherent imaging that has attracted much attention recently. Our results will find a wide range of applications over a broad spectrum of frequencies, from fluorescence microscopy to stellar interferometry.

Claude Shannon proved in 1949 that information-theoretic-secure encryption is possible if the encryption key is used only once, is random, and is at least as long as the message itself. Notwithstanding, when information is encoded in a quantum system, the phenomenon of quantum data locking allows one to encrypt a message with a shorter key and still provide information-theoretic security. We present one of the first feasible experimental demonstrations of quantum data locking for direct communication and propose a scheme for a quantum enigma machine that encrypts 6 bits per photon (containing messages, new encryption keys, and forward error correction bits) with less than 6 bits per photon of encryption key while remaining information-theoretically secure., 10 Figures

We present a protocol for generating multipartite quantum correlations across a quantum network with a continuous-variable architecture. An arbitrary number of users possess two-mode entangled states, keeping one mode while sending the other to a central relay. Here a suitable multipartite Bell detection is performed which conditionally generates a cluster state on the retained modes. This cluster state can be suitably manipulated by the parties and used for tasks of quantum communication in a fully optical scenario. More interestingly, the protocol can be used to create a purely-mechanical cluster state starting from a supply of optomechanical systems. We show that detecting the optical parts of optomechanical cavities may efficiently swap entanglement into their mechanical modes, creating cluster states up to 5 modes under suitable cryogenic conditions., Comment: REVTeX. 5 pages. 2 figures. Comments are welcome

One of the main open problems in quantum communication is the design of efficient quantum-secured networks. This is a challenging goal, because it requires protocols that guarantee both unconditional security and high communication rates, while increasing the number of users. In this scenario, continuous-variable systems provide an ideal platform where high rates can be achieved by using off-the-shelf optical components. At the same time, the measurement-device independent architecture is also appealing for its feature of removing a substantial portion of practical weaknesses. Driven by these ideas, here we introduce a modular design of continuous-variable network where each individual module is a measurement-device-independent star network. In each module, the users send modulated coherent states to an untrusted relay, creating multipartite secret correlations via a generalized Bell detection. Using one-time pad between different modules, the network users may share a quantum-secure conference key over arbitrary distances at constant rate., Comment: REVTeX. 18 pages (main text plus supplementary information), 8 figures

Rigorous mathematical proofs of the security of continuous-variable quantum key distribution (CV QKD) have been obtained recently. Unfortunately, these security proofs rely on assumptions that are hardly met in experimental practice. Here I investigate these issues in detail, and discuss experimentally-friendly workarounds to assess the security of CV QKD. The aim of this paper is to show that there are hidden and unsolved issues and to indicate possible partial solutions. To provide a complete and rigorous mathematical security proof is out of the scope of this contribution., Comment: Comments welcome. V3: close to published version

It has been recently shown that an interferometric measurement may allow for sub-wavelength resolution of incoherent light. Whereas this holds for noiseless detectors, one could expect that the resolution is in practice limited by signal-to-noise ratio. Here I present an assessment of the ultimate resolution limits that can be achieved using noisy detectors. My analysis indeed indicates that the signal-to-noise ratio represents a fundamental limit to quantum imaging, and the reduced resolution scales with the square root of the signal-to-noise ratio. For example, a signal-to-ratio of $20 dB$ is needed to resolve one order of magnitude below the Rayleigh limit., Comment: Comments welcome. v2: close to the published version

Quantum data locking is a quantum phenomenon that allows us to encrypt a long message with a small secret key with information-theoretic security. This is in sharp contrast with classical information theory where, according to Shannon, the secret key needs to be at least as long as the message. Here we explore photonic architectures for quantum data locking, where information is encoded in multi-photon states and processed using multi-mode linear optics and photo-detection, with the goal of extending an initial secret key into a longer one. The secret key consumption depends on the number of modes and photons employed. In the no-collision limit, where the likelihood of photon bunching is suppressed, the key consumption is shown to be logarithmic in the dimensions of the system. Our protocol can be viewed as an application of the physics of Boson Sampling to quantum cryptography. Experimental realisations are challenging but feasible with state-of-the-art technology, as techniques recently used to demonstrate Boson Sampling can be adapted to our scheme (e.g., Phys. Rev. Lett. 123, 250503, 2019).

We present a rigorous security analysis of Continuous-Variable Measurement-Device Independent Quantum Key Distribution (CV MDI QKD) in a finite size scenario. The security proof is obtained in two steps: by first assessing the security against collective Gaussian attacks, and then extending to the most general class of coherent attacks via the Gaussian de Finetti reduction. Our result combines recent state-of-the-art security proofs for CV QKD with new findings about min-entropy calculus and parameter estimation. In doing so, we improve the finite-size estimate of the secret key rate. Our conclusions confirm that CV MDI protocols allow for high rates on the metropolitan scale, and may achieve a nonzero secret key rate against the most general class of coherent attacks after 10^7-10^9 quantum signal transmissions, depending on loss and noise, and on the required level of security., v4: close to the published version (which is shorter than previous arXiv versions)

Quantum cryptography allows for unconditionally secure communication against an eavesdropper endowed with unlimited computational power and perfect technologies, who is only constrained by the laws of physics. We review recent results showing that, under the assumption that the eavesdropper can store quantum information only for a limited time, it is possible to enhance the performance of quantum key distribution in both a quantitative and qualitative fashion. We consider quantum data locking as a cryptographic primitive and discuss secure communication and key distribution protocols. For the case of a lossy optical channel, this yields the theoretical possibility of generating secret key at a constant rate of 1 bit per mode at arbitrarily long communication distances., United States. Army Research Office (United States. Defense Advanced Research Projects Agency. Quiness Program (W31P4Q-12-1-0019)

What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation stretching. Then, we prove that the minimum error probability affecting the channel discrimination cannot beat a bound determined by the Choi matrices of the channels, establishing a general, yet computable formula for quantum hypothesis testing. As a consequence of this bound, we derive ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution. Finally, we show how the methodology can also be applied to other tasks, such as quantum metrology, quantum communication and secret key generation., Close to published version. Main Text, Methods, and Supplementary Information all in a single file. 21 pages and 4 figures. REVTeX. Co-author added

We consider discrete-alphabet encoding schemes for coherent-state quantum key distribution. The sender encodes the letters of a finite-size alphabet into coherent states whose amplitudes are symmetrically distributed on a circle centered in the origin of the phase space. We study the asymptotic performance of this phase-encoded coherent-state protocol in direct and reverse reconciliation assuming both loss and thermal noise in the communication channel. In particular, we show that using just four phase-shifted coherent states is sufficient for generating secret key rates of the order of $4 \times 10^{-3}$ bits per channel use at about 15 dB loss in the presence of realistic excess noise., REVTeX. 8 pages. 7 figures

In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels, we may express the quantum Cram\'er Rao bound directly in terms of their Choi matrices. Our review considers both discrete- and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit., Comment: Short review paper. REVTeX 10 pages. 6 figures

We demonstrate a gigahertz source of verifiable quantum random numbers based on homodyne detection of the vacuum state. Using a whitening filter, we generate iid samples with a potential randomness rate of 20Gbit/s.

One crucial step in any quantum key distribution (QKD) scheme is parameter estimation. In a typical QKD protocol the users have to sacrifice part of their raw data to estimate the parameters of the communication channel as, for example, the error rate. This introduces a tradeoff between the secret key rate and the accuracy of parameter estimation in the finite-size regime. Here we show that continuous-variable (CV) QKD is not subject to this constraint as the whole raw keys can be used for both parameter estimation and secret key generation, without compromising the security. First we show that this property holds for measurement-device independent (MDI) protocols, as a consequence of the fact that in an MDI protocol the correlations between Alice and Bob are post-selected by the measurement performed by an untrusted relay. This result is then extended beyond the MDI framework by exploiting the fact that MDI protocols can simulate device-dependent one-way QKD with arbitrarily high precision., V4: Close to the published version

This corrects the article DOI: 10.1103/PhysRevLett.118.100502.

We demonstrate a large-scale tunable-coupling ring resonator array, suitable for high-dimensional classical and quantum transforms, in a CMOS-compatible silicon photonics platform. The device consists of a waveguide coupled to 15 ring-based dispersive elements with programmable linewidths and resonance frequencies. The ability to control both quality factor and frequency of each ring provides an unprecedented 30 degrees of freedom in dispersion control on a single spatial channel. This programmable dispersion control system has a range of applications, including mode-locked lasers, quantum key distribution, and photon-pair generation. We also propose a novel application enabled by this circuit – high-speed quantum communications using temporal-mode-based quantum data locking – and discuss the utility of the system for performing the high-dimensional unitary optical transformations necessary for a quantum data locking demonstration.

Compared with many other methods which only give time sub-optimal designs, the quantum brachistochrone equation has a great potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far it has been of limited use, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. This identification allows us to design a numerical method that can efficiently solve the brachistochrone problem by first solving a family of geodesic equations.

We determine the ultimate potential of quantum imaging for boosting the resolution of a far-field, diffraction-limited, linear imaging device within the paraxial approximation. First we show that the problem of estimating the separation between two point-like sources is equivalent to the estimation of the loss parameters of two lossy bosonic channels, i.e., the transmissivities of two beam splitters. Using this representation, we establish the ultimate precision bound for resolving two point-like sources in an arbitrary quantum state, with a simple formula for the specific case of two thermal sources. We find that the precision bound scales with the number of collected photons according to the standard quantum limit. Then we determine the sources whose separation can be estimated optimally, finding that quantum-correlated sources (entangled or discordant) can be super-resolved at the sub-Rayleigh scale. Our results set the upper bounds on any present or future imaging technology, from astronomical observation to microscopy, which is based on quantum detection as well as source engineering., v4: Improved results, better presentation, a few typos fixed, new figures and references added

We study the dynamics of one and two qubits plunged in a q-deformed oscillators environment. Specifically we evaluate the decay of quantum coherence and entanglement in time when passing from bosonic to fermionic environments. Slowing down of decoherence in the fermionic case is found. The effect only manifests at finite temperature., Comment: 12 pages, 2 figures

A large-scale tunable-coupling ring resonator array is demonstrated in a CMOS-compatible silicon photonics platform to achieve tunable frequency-dependent group delay. The system is proposed for a phase-encoded quantum data locking protocol.

We present an experimental demonstration of quantum data locking as a quantum enigma machine that encrypts 6 bits per photon with less than 6 bits per photon of encryption key while remaining information-theoretically secure.

Quantum information theory determines the maximum rates at which information can be transmitted through physical systems described by quantum mechanics. Here we consider the communication protocol known as quantum reading. Quantum reading is a protocol for retrieving the information stored in a digital memory by using a quantum probe, e.g., shining quantum states of light to read an optical memory. In a variety of situations using a quantum probe enhances the performances of the reading protocol in terms of fidelity, data density and energy dissipation. Here we review and characterize the quantum reading capacity of a memory model, defined as the maximum rate of reliable reading. We show that, like other quantities in quantum information theory, the quantum reading capacity is super-additive. Moreover, we determine conditions under which the use of an entangled ancilla improves the performance of quantum reading., Comment: 9 pages, 5 figures, comments welcome

When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can decode reliably if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We then prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels "mictodiactic"---they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers., Comment: 12 pages, accepted for publication in IEEE Transactions on Information Theory

Quantum physics allows for unconditionally secure communication through insecure communication channels. The achievable rates of quantum-secured communication are fundamentally limited by the laws of quantum physics and in particular by the properties of entanglement. For a lossy communication line, this implies that the secret-key generation rate vanishes at least exponentially with the communication distance. We show that this fundamental limitation can be violated in a realistic scenario where the eavesdropper can store quantum information for only a finite, yet arbitrarily long, time. We consider communication through a lossy bononic channel (modeling linear loss in optical fibers) and we show that it is in principle possible to achieve a constant rate of key generation of one bit per optical mode over arbitrarily long communication distances., 13 pages. V2: new title, new result on active attacks, increased rigour in the security proof

The tomographic approach to quantum mechanics is revisited as a direct tool to investigate violation of Bell-like inequalities. Since quantum tomograms are well defined probability distributions, the tomographic approach is emphasized to be the most natural one to compare the predictions of classical and quantum theory. Examples of inequalities for two qubits an two qutrits are considered in the tomographic probability representation of spin states., Comment: 11 pages, comments and references added

The partial scaling transform of the density matrix for multiqubit states is introduced to detect entanglement of quantum states. The transform contains partial transposition as a special case. The scaling transform corresponds to partial time scaling of subsystem (or partial Planck's constant scaling) which was used to formulate recently separability criterion for continous variables.A measure of entanglement which is a generalization of negativity measure is introduced being based on tomographic probability description of spin states., 16 pages, 5 figures, submitted to J. Phys. A: Math. Gen

Most methods of optimal control cannot obtain accurate time-optimal protocols. The quantum brachistochrone equation is an exception, and has the potential to provide accurate time-optimal protocols for a wide range of quantum control problems. So far, this potential has not been realized, however, due to the inadequacy of conventional numerical methods to solve it. Here we show that the quantum brachistochrone problem can be recast as that of finding geodesic paths in the space of unitary operators. We expect this brachistochrone-geodesic connection to have broad applications, as it opens up minimal-time control to the tools of geometry. As one such application, we use it to obtain a fast numerical method to solve the brachistochrone problem, and apply this method to two examples demonstrating its power.

We show that, if the accessible information is used as a security quantifier, quantum channels with a certain symmetry can convey private messages at a tremendously high rate, as high as less than one bit below the rate of non-private classical communication. This result is obtained by exploiting the quantum data locking effect. The price to pay to achieve such a high private communication rate is that accessible information security is in general not composable. However, composable security holds against an eavesdropper who is forced to measure her share of the quantum system within a finite time after she gets it., United States. Defense Advanced Research Projects Agency. Quiness Program (United States. Army Research Office. Grant W31P4Q-12-1-0019)

Quantum data locking is a unique quantum phenomenon that allows a relatively short key to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the encrypted message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the shared key by a proportionate amount. This implies that a constant size key can still encrypt an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random codewords, which very well could be helpful in discovering random codes for data locking over noisy quantum channels., A new result on the robustness of quantum data locking has been added