arXiv subjects

Stefan Wolf

Publications and source records attributed to Stefan Wolf.

At least 55 records · Page 3Linked to original sources

arXiv2017

Ultrafast optical ranging using microresonator soliton frequency combs

Light detection and ranging (LIDAR) is critical to many fields in science and industry. Over the last decade, optical frequency combs were shown to offer unique advantages in optical ranging, in particular when it comes to fast distance acquisition with high accuracy. However, current comb-based concepts are not suited for emerging high-volume applications such as drone navigation or autonomous driving. These applications critically rely on LIDAR systems that are not only accurate and fast, but also compact, robust, and amenable to cost-efficient mass-production. Here we show that integrated dissipative Kerr-soliton (DKS) comb sources provide a route to chip-scale LIDAR systems that combine sub-wavelength accuracy and unprecedented acquisition speed with the opportunity to exploit advanced photonic integration concepts for wafer-scale mass production. In our experiments, we use a pair of free-running DKS combs, each providing more than 100 carriers for massively parallel synthetic-wavelength interferometry. We demonstrate dual-comb distance measurements with record-low Allan deviations down to 12 nm at averaging times of 14 $μ$s as well as ultrafast ranging at unprecedented measurement rates of up to 100 MHz. We prove the viability of our technique by sampling the naturally scattering surface of air-gun projectiles flying at 150 m/s (Mach 0.47). Combining integrated dual-comb LIDAR engines with chip-scale nanophotonic phased arrays, the approach could allow widespread use of compact ultrafast ranging systems in emerging mass applications.

physics.optics↗

arXiv2017

Microresonator solitons for massively parallel coherent optical communications

Optical solitons are waveforms that preserve their shape while propagating, relying on a balance of dispersion and nonlinearity. Soliton-based data transmission schemes were investigated in the 1980s, promising to overcome the limitations imposed by dispersion of optical fibers. These approaches, however, were eventually abandoned in favor of wavelength-division multiplexing (WDM) schemes that are easier to implement and offer improved scalability to higher data rates. Here, we show that solitons may experience a comeback in optical communications, this time not as a competitor, but as a key element of massively parallel WDM. Instead of encoding data on the soliton itself, we exploit continuously circulating dissipative Kerr solitons (DKS) in a microresonator. DKS are generated in an integrated silicon nitride microresonator by four-photon interactions mediated by Kerr nonlinearity, leading to low-noise, spectrally smooth and broadband optical frequency combs. In our experiments, we use two interleaved soliton Kerr combs to transmit a data stream of more than 50Tbit/s on a total of 179 individual optical carriers that span the entire telecommunication C and L bands. Equally important, we demonstrate coherent detection of a WDM data stream by using a pair of microresonator Kerr soliton combs - one as a multi-wavelength light source at the transmitter, and another one as a corresponding local oscillator (LO) at the receiver. This approach exploits the scalability advantages of microresonator soliton comb sources for massively parallel optical communications both at the transmitter and receiver side. Taken together, the results prove the significant potential of these sources to replace arrays of continuous-wave lasers in high-speed communications.

nlin.PS↗

arXiv2017

Non-causal computation

Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm beyond quantum computing, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is locally assumed whilst the global causal structure between the gates is dropped. We present examples of logically consistent non- causal circuits outperforming all causal ones; they imply that suppressing loops entirely is more restrictive than just avoiding the contradictions they can give rise to. That fact is already known for correlations as well as for communication, and we here extend it to computation.

quant-ph↗

arXiv2017

An All-Or-Nothing Flavor to the Church-Turing Hypothesis

Landauer's principle claims that "Information is Physical." It is not surprising that its conceptual antithesis, Wheeler's "It from Bit," has been more popular among computer scientists --- in the form of the Church-Turing hypothesis: All natural processes can be computed by a universal Turing machine; physical laws then become descriptions of subsets of observable, as opposed to merely possible, computations. Switching back and forth between the two traditional styles of thought, motivated by quantum-physical Bell correlations and the doubts they raise about fundamental space-time causality, we look for an intrinsic, physical randomness notion and find one around the second law of thermodynamics. Bell correlations combined with complexity as randomness tell us that beyond-Turing computations are either physically impossible, or they can be carried out by "devices" as simple as individual photons.

quant-ph↗

arXiv2016

The measurement problem is the measurement problem is the measurement problem

Recently, it has been stated that single-world interpretations of quantum theory are logically inconsistent. The claim is derived from contradicting statements of agents in a setup combining two Wigner's-friend experiments. Those statements stem from applying the measurement-update rule subjectively, i.e., only for the respective agent's own measurement. We argue that the contradiction expresses the incompatibility of collapse and unitarity - resulting in different formal descriptions of a measurement - and does not allow to dismiss any specific interpretation of quantum theory.

quant-ph↗

arXiv2016

Can non-local correlations be discriminated in polynomial time?

In view of the importance of quantum non-locality in cryptography, quantum computation and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not. In the light of a theorem by Pitowski, it is generally believed that this problem is computationally intractable. In this paper, we first prove that the Euclidean distance of given correlations from the local polytope can be computed in polynomial time with arbitrary fixed error, granted the access to a certain oracle. Namely, given a fixed error, we derive two upper bounds on the running time. The first bound is linear in the number of measurements. The second bound scales as the number of measurements to the sixth power. The former is dominant only for a very high number of measurements and is never saturated in the performed numerical tests. We then introduce a simple algorithm for simulating the oracle. In all the considered numerical tests, the simulation of the oracle contributes with a multiplicative factor to the overall running time and, thus, does not affect the sixth-power law of the oracle-assisted algorithm.

quant-ph↗

arXiv2016

Optimal measurements for nonlocal correlations

A problem in quantum information theory is to find the experimental setup that maximizes the nonlocality of correlations with respect to some suitable measure such as the violation of Bell inequalities. The latter has however some drawbacks. First and foremost it is unfeasible to determine the whole set of Bell inequalities already for a few measurements and thus unfeasible to find the experimental setup maximizing their violation. Second, the Bell violation suffers from an ambiguity stemming from the choice of the normalization of the Bell coefficients. An alternative measure of nonlocality with a direct information-theoretic interpretation is the minimal amount of classical communication required for simulating nonlocal correlations. In the case of many instances simulated in parallel, the minimal communication cost per instance is called nonlocal capacity, and its computation can be reduced to a convex-optimization problem. This quantity can be computed for a higher number of measurements and turns out to be useful for finding the optimal experimental setup. Focusing on the bipartite case, in this paper, we present a simple method for maximizing the nonlocal capacity over a given configuration space and, in particular, over a set of possible measurements, yielding the corresponding optimal setup. Furthermore, we show that there is a functional relationship between Bell violation and nonlocal capacity. The method is illustrated with numerical tests and compared with the maximization of the violation of CGLMP-type Bell inequalities on the basis of entangled two-qubit as well as two-qutrit states. Remarkably, the anomaly of nonlocality displayed by qutrits turns out to be even stronger if the nonlocal capacity is employed as a measure of nonlocality.

quant-ph↗

arXiv2016

Device-independent test of causal order and relations to fixed-points

Bell non-local correlations cannot be naturally explained in a fixed causal structure. This serves as a motivation for considering models where no global assumption is made beyond logical consistency. The assumption of a fixed causal order between a set of parties, together with free randomness, implies device-independent inequalities --- just as the assumption of locality does. It is known that local validity of quantum theory is consistent with violating such inequalities. Moreover, for three parties or more, even the (stronger) assumption of local classical probability theory plus logical consistency allows for violating causal inequalities. Here, we show that a classical environment (with which the parties interact), possibly containing loops, is logically consistent if and only if whatever the involved parties do, there is exactly one fixed-point, the latter being representable as a mixture of deterministic fixed-points. We further show that the non-causal view allows for a model of computation strictly more powerful than computation in a world of fixed causal orders.

quant-ph↗

arXiv2016

Information-based measure of nonlocality

Quantum nonlocality concerns correlations among spatially separated systems that cannot be classically explained without post-measurement communication among the parties. Thus, a natural measure of nonlocal correlations is provided by the minimal amount of communication required for classically simulating them. In this paper, we present a method to compute the minimal communication cost, which we call nonlocal capacity, for any general nonsignaling correlations. This measure turns out to have an important role in communication complexity and can be used to discriminate between local and nonlocal correlations, as an alternative to the violation of Bell's inequalities.

quant-ph↗

arXiv2016

Stronger Attacks on Causality-Based Key Agreement

Remarkably, it has been shown that in principle, security proofs for quantum key-distribution (QKD) protocols can be independent of assumptions on the devices used and even of the fact that the adversary is limited by quantum theory. All that is required instead is the absence of any hidden information flow between the laboratories, a condition that can be enforced either by shielding or by space-time causality. All known schemes for such Causal Key Distribution (CKD) that offer noise-tolerance (and, hence, must use privacy amplification as a crucial step) require multiple devices carrying out measurements in parallel on each end of the protocol, where the number of devices grows with the desired level of security. We investigate the power of the adversary for more practical schemes, where both parties each use a single device carrying out measurements consecutively. We provide a novel construction of attacks that is strictly more powerful than the best known attacks and has the potential to decide the question whether such practical CKD schemes are possible in the negative.

quant-ph↗

arXiv2016

Single-laser 32.5 Tbit/s Nyquist WDM transmission

We demonstrate 32.5 Tbit/s 16QAM Nyquist WDM transmission over a total length of 227 km of SMF-28 without optical dispersion compensation. A number of 325 optical carriers are derived from a single laser and encoded with dual-polarization 16QAM data using sinc-shaped Nyquist pulses. As we use no guard bands, the carriers have a spacing of 12.5 GHz equal to the Nyquist bandwidth of the data. We achieve a high net spectral efficiency of 6.4 bit/s/Hz using a software-defined transmitter which generates the electrical modulator drive signals in real-time.

cs.NI↗

arXiv2016

The space of logically consistent classical processes without causal order

Classical correlations without predefined causal order arise from processes where parties manipulate random variables, and where the order of these interactions is not predefined. No assumption on the causal order of the parties is made, but the processes are restricted to be logically consistent under any choice of the parties' operations. It is known that for three parties or more, this set of processes is larger than the set of processes achievable in a predefined ordering of the parties. Here, we model all classical processes without predefined causal order geometrically and find that the set of such processes forms a polytope. Additionally, we model a smaller polytope --- the deterministic-extrema polytope --- where all extremal points represent deterministic processes. This polytope excludes probabilistic processes that must be --- quite unnaturally --- fine-tuned, because any variation of the weights in a decomposition into deterministic processes leads to a logical inconsistency.

quant-ph↗

arXiv2015

Non-Locality Without Counterfactual Reasoning

Non-local correlations are usually understood through the outcomes of alternative measurements (on two or more parts of a system) that cannot altogether actually be carried out in an experiment. Indeed, a joint input/output -- e.g., measurement-setting/outcome -- behavior is non-local if and only if the outputs for all possible inputs cannot coexist consistently. It has been argued that this counterfactual view is how Bell's inequalities and their violations are to be seen. We propose an alternative perspective which refrains from setting into relation the results of mutually exclusive measurements, but that is based solely on data actually available. Our approach uses algorithmic complexity instead of probability, implies non-locality to have similar consequences as in the probabilistic view, and is conceptually simpler yet at the same time more general than the latter.

quant-ph↗

arXiv2014

Maximal incompatibility of locally classical behavior and global causal order in multi-party scenarios

Quantum theory in a global space-time gives rise to non-local correlations, which cannot be explained causally in a satisfactory way; this motivates the study of theories with reduced global assumptions. Oreshkov, Costa, and Brukner (2012) proposed a framework in which quantum theory is valid locally but where, at the same time, no global space-time, i.e., predefined causal order, is assumed beyond the absence of logical paradoxes. It was shown for the two-party case, however, that a global causal order always emerges in the classical limit. Quite naturally, it has been conjectured that the same also holds in the multi-party setting. We show that counter to this belief, classical correlations locally compatible with classical probability theory exist that allow for deterministic signaling between three or more parties incompatible with any predefined causal order.

quant-ph↗

arXiv2014

Necessary and sufficient optimality conditions for classical simulations of quantum communication processes

We consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required for classically simulating it. Recently, we reduced the computation of this quantity to a convex minimization problem with linear constraints. Every solution of the constraints provides an upper bound on the communication complexity. In this paper, we derive the dual maximization problem of the original one. The feasible points of the dual constraints, which are inequalities, give lower bounds on the communication complexity, as illustrated with an example. The optimal values of the two problems turn out to be equal (zero duality gap). By this property, we provide necessary and sufficient conditions for optimality in terms of a set of equalities and inequalities. We use these conditions and two reasonable but unproven hypotheses to derive the lower bound $n 2^{n-1}$ for a noiseless quantum channel with capacity equal to $n$ qubits. This lower bound can have interesting consequences in the context of the recent debate on the reality of the quantum state.

quant-ph↗

arXiv2014

Lower bounds on the communication complexity of two-party (quantum) processes

The process of state preparation, its transmission and subsequent measurement can be classically simulated through the communication of some amount of classical information. Recently, we proved that the minimal communication cost is the minimum of a convex functional over a space of suitable probability distributions. It is now proved that this optimization problem is the dual of a geometric programming maximization problem, which displays some appealing properties. First, the number of variables grows linearly with the input size. Second, the objective function is linear in the input parameters and the variables. Finally, the constraints do not depend on the input parameters. These properties imply that, once a feasible point is found, the computation of a lower bound on the communication cost in any two-party process is linearly complex. The studied scenario goes beyond quantum processes and includes the communication complexity scenario introduced by Yao. We illustrate the method by analytically deriving some non-trivial lower bounds. Finally, we conjecture the lower bound $n 2^n$ for a noiseless quantum channel with capacity $n$ qubits. This bound can have an interesting consequence in the context of the recent quantum-foundational debate on the reality of the quantum state.

quant-ph↗

arXiv2014

Perfect signaling among three parties violating predefined causal order

The paradigmatic view where information is seen as a more fundamental concept than the laws of physics leads to a different understanding of spacetime where the causal order of events emerges from correlations between random variables representing physical quantities. In particular, such an information-theoretic approach does not enforce a global spacetime structure. By following this path, we conclude that perfect signaling correlations among three parties are possible which do not obey the restrictions imposed by global spacetime. We show this using a recent framework based on the sole assumptions that locally, quantum theory is valid and random variables can be described by probability distributions. Our result is of zero-error type and is an analog to a tripartite appearance of quantum non-locality which manifests itself by satisfying a condition with certainty whereas the same is impossible for any local theory.

quant-ph↗

arXiv2013

Trading Permutation Invariance for Communication in Multi-Party Non-Locality Distillation

Quantum theory puts forward phenomena unexplainable by classical physics - or information, for that matter. A prominent example is non-locality. Non-local correlations cannot be explained, in classical terms, by shared information but only by communication. On the other hand, the phenomenon does not allow for (potentially faster-than-light) message transmission. The fact that some non-local and non-signaling correlations are predicted by quantum theory, whereas others fail to be, asks for a criterion, as simple as possible, that characterizes which joint input-output behaviors are ``quantum'' and which are not. In the context of the derivation of such criteria, it is of central importance to understand when non-local correlations can be amplified by a non-interactive protocol, i.e., whether some types of weak non-locality can be distilled into stronger by local operations. Since it has been recognized that the searched-for criteria must inherently be multi-partite, the question of distillation, extensively studied and understood two-party scenarios, should be adressed in the multi-user setting, where much less is known. Considering the space of intrinsically n-partite correlations, we show the possibility of distilling weak non-local boxes to the algebraically maximal ones without any communication. Our protocols improve on previously known methods which still required partial communication. The price we have to pay for dropping the need for communication entirely is the assumption of permutation invariance: Any correlation that can be realized between some set of players is possible between any such set. This assumption is very natural since the laws of physics are invariant under spacial translation.

quant-ph↗