Vaidman, in a recent article adopts the method of 'quantum weak measurements in pre- and postselected ensembles' to ascertain whether or not the chained-Zeno counterfactual computation scheme proposed by Hosten et al. is counterfactual; which has been the topic of a debate on the definition of counterfactuality. We disagree with his conclusion, which brings up some interesting aspects of quantum weak measurements and some concerns about the way they are interpreted.
Counterfactual communication protocols are analysed using three approaches: a classical argument, the weak trace criterion, and the Fisher information criterion. It is argued that the classical analysis leads to contradiction and should therefore be abandoned. The weak trace and Fisher information criteria are shown to agree about the degree of counterfactuality of communication protocols involving postselection. It is argued that postselection is a necessary ingredient of counterfactual communication protocols. Coherent interaction experiments, as well as a recently introduced modification of…
A recent analysis [quant-ph/0104062] suggests that weak measurements can be used to give observational meaning to counterfactual reasoning in quantum physics. A weak measurement is predicted to assign a negative unit population to a specific state in an interferometric Gedankenexperiment proposed by Hardy. We propose an experimental implementation with trapped ions of the Gedankenexperiment and of the weak measurement. In our standard quantum mechanical analysis of the proposal no states have negative population, but we identify the registration of a negative population by particles being disp…
Universal quantum computation is usually associated with interaction among two-level quantum subsystems, as this interaction is commonly viewed as a necessity to achieve universal quantum computation. In this work, we show that, contrary to this intuition, universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems. We call it counterfactual universal quantum computation. As special cases, we show how to achieve counterfactual communication of quantum states, counterfactual quantum swapping, and counterfactual quantum erasure codes…
Recent proposal for counterfactual computation [Hosten et al., Nature, 439, 949 (2006)] is analyzed. It is argued that the method does not provide counterfactual computation for all possible outcomes. The explanation involves a novel paradoxical feature of pre- and post-selected quantum particles: the particle can reach a certain location without being on the path that leads to this location.
Mitchison and Jozsa recently suggested that the "chained-Zeno" counterfactual computation protocol recently proposed by Hosten et al. is counterfactual for only one output of the computer. This claim was based on the existing abstract algebraic definition of counterfactual computation, and indeed according to this definition, their argument is correct. However, a more general definition (physically adequate) for counterfactual computation is implicitly assumed by Hosten et. al. Here we explain in detail why the protocol is counterfactual and how the "history tracking" method of the existing de…
Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through t…
We show that the protocol recently proposed by Hosten et al. does not allow all possible results of a computation to be obtained counterfactually, as was claimed. It only gives a counterfactual outcome for one of the computer outputs. However, we confirm the observation that the protocol gives some protection against decoherence. In some situations, though, it may be more effective simply to run the computer several times.
The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message "counterfactually". That is, without Alice receiving any particles that have interacted with Bob. By utilising a setup built on results from interaction-free measurements, we outline a communication protocol whereby the information travels in the opposite direction of the emitted particles. In comparison to previous attempts on such protocols, this one is suc…
Suppose that we are given a quantum computer programmed ready to perform a computation if it is switched on. Counterfactual computation is a process by which the result of the computation may be learnt without actually running the computer. Such processes are possible within quantum physics and to achieve this effect, a computer embodying the possibility of running the computation must be available, even though the computation is, in fact, not run. We study the possibilities and limitations of general protocols for the counterfactual computation of decision problems (where the result r is eith…
We introduce a scheme for fault tolerantly dealing with losses (or other "leakage" errors) in cluster state computation that can tolerate up to 50% qubit loss. This is achieved passively using an adaptive strategy of measurement - no coherent measurements or coherent correction is required. Since the scheme relies on inferring information about what would have been the outcome of a measurement had one been able to carry it out, we call this "counterfactual" error correction.
Classical-realistic analysis of entangled systems have lead to retrodiction paradoxes, which ordinarily have been dismissed on the grounds of counter-factuality. Instead, we claim that such paradoxes point to a deeper logical structure inherent to quantum mechanics, which is naturally described in the language of weak values, and which is accessible experimentally via weak measurements. Using as an illustration, a gedanken-experiment due to Hardy\cite{hardy}, we show that there is in fact an exact numerical coincidence between a) a pair of classically contradictory assertions about the locatio…
We revisit the "counterfactual quantum communication" of Salih et al. [1], who claim that an observer "Bob" can send one bit of information to a second observer "Alice" without any physical particle traveling between them. We show that a locally conserved, massless current - specifically, a current of modular angular momentum, $L_z$ mod 2$\hbar$ - carries the one bit of information. We integrate the flux of $L_z$ mod 2$\hbar$ from Bob to Alice and show that it equals one of the two eigenvalues of $L_z$ mod 2$\hbar$, either 0 or $\hbar$, thus precisely accounting for the one bit of information …
Counterfactual quantum key distribution provides natural advantage against the eavesdropping on the actual signal particles. It can prevent the photon-number-splitting attack when a weak coherent light source is used for the practical implementation. We realized the counterfactual quantum key distribution in an unbalanced Mach-Zehnder interferometer of 12.5-km-long quantum channel with a high-fringe visibility of 96:4%. As a result, we obtained secure keys against the noise-induced attack (eg. the vacuum attack) and passive photon-number-splitting attack.
Counterfactual quantum key distribution (QKD) enables two parties to share a secret key using an interaction-free measurement. Here, we point out that the efficiency of counterfactual QKD protocols can be enhanced by including non-counterfactual bits. This inclusion potentially gives rise to the possibility of noiseless attacks, in which Eve can gain knowledge of the key bits without introducing any errors in the quantum channel. We show how this problem can be resolved in a simple way that naturally leads to the idea of "counterfactual security", whereby the non-counterfactual key bits are in…
A recent quantum protocol for counterfactual communication [Y. Aharonov and L. Vaidman, Phys. Rev. A 99, 010103(R), 2019] relies on post-selection to eliminate the weak trace in the transmission channel. We show that the post-selection in this protocol also eliminates the flow of Fisher information from transmitter to receiver. However, we also show that a classical communication protocol with post-selection can be counterfactual. Hence, we argue that post-selection should not be allowed in genuine counterfactual communication. In the quantum counterfactual communication protocol, the probabil…
Two typical entanglements will be shown to stand on opposite sides on the issue of \emph{instrumental realism}, the issue of whether (as for EPR in the original form or EPRB, Bohm's versions using spin) or not (as for GHZ) observables have values that preexist measurement. Instrumental realism in the EPR context helps us prove that in some special circumstances, one can get simultaneous knowledge of two conjugate quantities, which in particular make sense together. This shatters the axiomatic presentation of Quantum Mechanics. This simultaneous knowledge of two conjugate quantities elaborates …
The possibility of interaction-free measurements and counterfactual computations is a striking feature of quantum mechanics pointed out around 20 years ago. We implement such phenomena in actual 5-qubit, 15-qubit and 20-qubit IBM quantum computers by means of simple quantum circuits. The results are in general close to the theoretical expectations. For the larger circuits (with numerous gates and consequently larger errors) we implement a simple error mitigation procedure which improve appreciably the performance.
Quantum computation with photons requires efficient two photon gates. We put forward a two photon entangling gate which uses an intermediate atomic system. The system includes a single Rydberg atom which can switch on and off photon absorption in an ensemble using the dipole blockade. The gate is based in a counterfactual protocol. The mere possibility of an absorption that can only occur with a vanishing probability steers the photons to the desired final state.
A relation is obtained between weak values of quantum observables and the consistency criterion for histories of quantum events. It is shown that ``strange'' weak values for projection operators (such as values less than zero) always correspond to inconsistent families of histories. It is argued that using the ABL rule to obtain probabilities for counterfactual measurements corresponding to those strange weak values gives inconsistent results. This problem is shown to be remedied by using the conditional weight, or pseudo-probability, obtained from the multiple-time application of Luders' Rule…
Distributed computing is a fastest growing field -- enabling virtual computing, parallel computing, and distributed storage. By exploiting the counterfactual techniques, we devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation for any input state without using preshared entanglement and without exchanging physical particles between remote parties. This distributed protocol allows Bob to counterfactully apply an arbitrary unitary operator to Alice's qubit in probabilistic fashion, without revealing the operator to her, using a cont…
In this study, we study weak values from a quantum-logical viewpoint. In addition, we examine the validity of the counterfactual statements of Hardy's paradox, which are based on weak values, and we show that these statements have not been validated. It is also shown that strange weak values may only appear if they are not (conditional) probabilities. PACS numbers: 03.65.Ta, 03.65.Ud, 03.65.Ca
Among the (in)famous differences between classical and quantum mechanics, quantum counterfactuals seem to be the most intriguing. At the same time, they seem to underlie many quantum oddities. In this article, we propose a simple explanation for counterfactuals, on two levels. Quantum Oblivion (QO) is a fundamental type of quantum interaction that we prove to be the origin of quantum counterfactuals. It also turns out to underlie several well-known quantum effects. This phenomenon is discussed in the first part of the article, yielding some novel predictions. In the second part, a hypothesis i…
Counterfactual quantum cryptography (CQC) is used here as a tool to assess the status of the quantum state: Is it real/ontic (an objective state of Nature) or epistemic (a state of the observer's knowledge)? In contrast to recent approaches to wave function ontology, that are based on realist models of quantum theory, here we recast the question as a problem of communication between a sender (Bob), who uses interaction-free measurements, and a receiver (Alice), who observes an interference pattern in a Mach-Zehnder set-up. An advantage of our approach is that it allows us to define the concept…
The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When these observables do not commute, we may obtain information about joint properties of a quantum system that would be forbidden in the usual strong measurement scenario. As an application, we provide a physically compelling characterisation of the notion of counterfactual quantum computation.
