Searcharxiv⌕ Search

arXiv subjects

Aharon Brodutch

Publications and source records attributed to Aharon Brodutch.

At least 37 records · Page 2Linked to original sources

Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol

A fully homomorphic encryption system hides data from unauthorized parties, while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more powerful server without revealing their inputs, a fully homomorphic cryptosystem can be used as a building block in the construction of a number of cryptographic functionalities. Designing such a scheme remained an open problem until 2009, decades after the idea was first conceived, and the past few years have seen the generalization of this functionality to the world of quantum machines. Quantum schemes prior to the one implemented here were able to replicate some features in particular use-cases often associated with homomorphic encryption but lacked other crucial properties, for example, relying on continual interaction to perform a computation or leaking information about the encrypted data. We present the first experimental realisation of a quantum fully homomorphic encryption scheme. We further present a toy two-party secure computation task enabled by our scheme. Finally, as part of our implementation, we also demonstrate a post-selective two-qubit linear optical controlled-phase gate with a much higher post-selection success probability (1/2) when compared to alternate implementations, e.g. with post-selective controlled-$Z$ or controlled-$X$ gates (1/9).

quant-ph↗

Dynamically Reconfigurable Sources for Arbitrary Gaussian States in Integrated Photonics Circuits

We present a modular design for integrated programmable multimode sources of arbitrary Gaussian states of light. The technique is based on current technologies, in particular recent demonstrations of on-chip photon manipulation and generation of highly squeezed vacuum states in semiconductors. While the design is generic and independent of the choice of integrated platform, we adopt recent experimental results on compound semiconductors as a demonstrative example. Such a device would be valuable as a source for many quantum protocols that range from imaging to communication and information processing.

quant-ph↗

Entanglement Enhancement in Multimode Integrated Circuits

The faithful distribution of entanglement in continuous variable systems is essential to many quantum information protocols. As such, entanglement distillation and enhancement schemes are a cornerstone of many applications. The photon subtraction scheme offers enhancement with a relatively simple setup and has been studied in various scenarios. Motivated by recent advances in integrated optics, particularly the ability to build stable multimode interferometers with squeezed input states, a multimodal extension to the enhancement via photon subtraction protocol is studied. States generated with multiple squeezed input states, rather than a single input source, are shown to be more sensitive to the enhancement protocol, leading to increased entanglement at the output. Numerical results show the gain in entanglement is not monotonic with the number of modes or the degree of squeezing in the additional modes. Consequently, the advantage due to having multiple squeezed inputs states can be maximized when the number of modes is still relatively small (e.g., $4$). The requirement for additional squeezing is within the current realm of implementation, making this scheme achievable with present technologies.

quant-ph↗

Enhancing quantum control by bootstrapping a quantum processor of 12 qubits

Accurate and efficient control of quantum systems is one of the central challenges for quantum information processing. Current state-of-the-art experiments rarely go beyond 10 qubits and in most cases demonstrate only limited control. Here we demonstrate control of a 12-qubit system, and show that the system can be employed as a quantum processor to optimize its own control sequence by using measurement-based feedback control (MQFC). The final product is a control sequence for a complex 12-qubit task: preparation of a 12-coherent state. The control sequence is about 10% more accurate than the one generated by the standard (classical) technique, showing that MQFC can correct for unknown imperfections. Apart from demonstrating a high level of control over a relatively large system, our results show that even at the 12-qubit level, a quantum processor can be a useful lab instrument. As an extension of our work, we propose a method for combining the MQFC technique with a twirling protocol, to optimize the control sequence that produces a desired Clifford gate.

quant-ph↗

Extrapolated Quantum States, Void States, and a Huge Novel Class of Distillable Entangled States

A nice and interesting property of any pure tensor-product state is that each such state has distillable entangled states at an arbitrarily small distance $ε$ in its neighborhood. We say that such nearby states are $ε$-entangled, and we call the tensor product state in that case, a "boundary separable state", as there is entanglement at any distance from this "boundary". Here we find a huge class of separable states that also share that property mentioned above -- they all have $ε$-entangled states at any small distance in their neighborhood. Furthermore, the entanglement they have is proven to be distillable. We then extend this result to the discordant/classical cut and show that all classical states (correlated and uncorrelated) have discordant states at distance $ε$, and provide a constructive method for finding $ε$-discordant states.

quant-ph↗

Entanglement and deterministic quantum computing with one qubit

The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present new tools for learning about entanglement and quantum correlations in dynamical systems where the quantum states are mixed and the eigenvalue spectrum is highly degenerate. We apply these results to the Deterministic quantum computing with one qubit (DQC1) computation model and show that the states generated in a DQC1 circuit have an eigenvalue structure that makes them difficult to entangle, even when they are relatively far from the completely mixed state. Our results strengthen the conjecture that it may be possible to find quantum algorithms that do not generate entanglement and yet still have an exponential advantage over their classical counterparts.

quant-ph↗

A Scheme for Performing Strong and Weak Sequential Measurements of Non-commuting Observables

Quantum systems usually travel a multitude of different paths when evolving through time from an initial to a final state. In general, the possible paths will depend on the future and past boundary conditions, as well as the system's dynamics. We present a gedanken experiment where a single system apparently follows mutually exclusive paths simultaneously, each with probability one, depending on which measurement was performed. This experiment involves the measurement of observables that do not correspond to Hermitian operators. Our main result is a scheme for measuring these operators. The scheme is based on the erasure protocol [Phys. Rev. Lett. 116, 070404 (2016), arXiv:1409.1575] and allows a wide range of sequential measurements at both the weak and strong limits. At the weak limit the back action of the measurement cannot be used to account for the surprising behavior and the resulting weak values provide a consistent yet strange account of the system's past.

quant-ph↗

Why should we care about quantum discord?

Entanglement is a central feature of quantum theory. Mathematical properties and physical applications of pure state entanglement make it a template to study quantum correlations. However, an extension of entanglement measures to mixed states in terms of separability does not always correspond to all the operational aspects. Quantum discord measures allow an alternative way to extend the idea of quantum correlations to mixed states. In many cases these extensions are motivated by physical scenarios and quantum information protocols. In this chapter we discuss several settings involving correlated quantum systems, ranging from distributed gates to detectors testing quantum fields. In each setting we show how entanglement fails to capture the relevant features of the correlated system, and discuss the role of discord as a possible alternative.

quant-ph↗

Experimental violation of the Leggett-Garg inequality in a 3-level system

The Leggett-Garg (LG) test of macroscopic realism involves a series of dichotomic non-invasive measurements that are used to calculate a function which has a fixed upper bound for a macrorealistic system and a larger upper bound for a quantum system. The quantum upper bound depends on both the details of the measurement and the dimension of the system. Here we present an LG experiment on a three-level quantum system, which produces a larger theoretical quantum upper bound than that of a two-level quantum system. The experiment is carried out in nuclear magnetic resonance (NMR) and consists of the LG test as well as a test of the ideal assumptions associated with the experiment, such as measurement non-invasiveness. The non-invasive measurements are performed via the modified ideal negative result measurement scheme on a three-level system. Once these assumptions are tested, the violation becomes small, despite the fact that the LG value itself is large. Our results showcase the advantages of using the modified measurement scheme that can reach the higher LG values, as they give more room for hypothetical malicious errors in a real experiment

quant-ph↗

An adaptive attack on Wiesner's quantum money

Unlike classical money, which is hard to forge for practical reasons (e.g. producing paper with a certain property), quantum money is attractive because its security might be based on the no-cloning theorem. The first quantum money scheme was introduced by Wiesner circa 1970. Although more sophisticated quantum money schemes were proposed, Wiesner's scheme remained appealing because it is both conceptually clean and relatively easy to implement. We show efficient adaptive attacks on Wiesner's quantum money scheme [Wie83] (and its variant by Bennett et al. [BBBW83]), when valid money is accepted and passed on, while invalid money is destroyed. We propose two attacks, the first is inspired by the Elitzur-Vaidman bomb testing problem [EV93, KWH+95], while the second is based on the idea of protective measurements [AAV93]. It allows us to break Wiesner's scheme with 4 possible states per qubit, and generalizations which use more than 4 states per qubit.

quant-ph↗

Nonlocal Measurements via Quantum Erasure

Non-local observables play an important role in quantum theory, from Bell inequalities and various post-selection paradoxes to quantum error correction codes. Instantaneous measurement of these observables is known to be a difficult problem, especially when the measurements are projective. The standard von Neumann Hamiltonian used to model projective measurements cannot be implemented directly in a non-local scenario and can, in some cases, violate causality. We present a scheme for effectively generating the von Neumann Hamiltonian for non-local observables without the need to communicate and adapt. The protocol can be used to perform weak and strong (projective) measurements, as well as measurements at any intermediate strength. It can also be used in practical situations beyond non-local measurements. We show how the protocol can be used to probe a version of Hardy's paradox with both weak and strong measurements. The outcomes of these measurements provide a non-intuitive picture of the pre- and post-selected system. Our results shed new light on the interplay between quantum measurements, uncertainty, non-locality, causality and determinism.

quant-ph↗

NMR quantum information processing

Quantum computing exploits fundamentally new models of computation based on quantum mechanical properties instead of classical physics, and it is believed that quantum computers are able to dramatically improve computational power for particular tasks. At present, nuclear magnetic resonance (NMR) has been one of the most successful platforms amongst all current implementations. It has demonstrated universal controls on the largest number of qubits, and many advanced techniques developed in NMR have been adopted to other quantum systems successfully. In this review, we show how NMR quantum processors can satisfy the general requirements of a quantum computer, and describe advanced techniques developed towards this target. Additionally, we review some recent NMR quantum processor experiments. These experiments include benchmarking protocols, quantum error correction, demonstrations of algorithms exploiting quantum properties, exploring the foundations of quantum mechanics, and quantum simulations. Finally we summarize the concepts and comment on future prospects.

quant-ph↗

Post-Newtonian gravitational effects in quantum interferometry

We investigate general properties of optical interferometry in stationary spacetimes and apply the obtained results focusing on quantum-optical experiments in near-Earth environments. We provide a rigorous expression for the {gravitationally induced} phase difference and adapt the parametrized post-Newtonian formalism for calculations of polarization rotation. We investigate two optical versions of the Colella-Overhauser-Werner experiment and show that the phase difference is independent of the post-Newtonian parameter $γ$, making it a possible candidate for an optical test of the Einstein equivalence principle. Polarization rotation provides an example of the quantum clock variable, and while related to the optical Lense-Thirring effects, shows a qualitatively different behaviour.

quant-ph↗

Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor

Quantum gates in experiment are inherently prone to errors that need to be characterized before they can be corrected. Full characterization via quantum process tomography is impractical and often unnecessary. For most practical purposes, it is enough to estimate more general quantities such as the average fidelity. Here we use a unitary 2-design and twirling protocol for efficiently estimating the average fidelity of Clifford gates, to certify a 7-qubit entangling gate in a nuclear magnetic resonance quantum processor. Compared with more than $10^8$ experiments required by full process tomography, we conducted 1656 experiments to satisfy a statistical confidence level of 99%. The average fidelity of this Clifford gate in experiment is 55.1%, and rises to 87.5% if the infidelity due to decoherence is removed. The entire protocol of certifying Clifford gates is efficient and scalable, and can easily be extended to any general quantum information processor with minor modifications.

quant-ph↗

Weak measurements of non local variables

Methods for measuring the weak value of non local variables are investigated. We analyze local (indirect) measurement methods for obtaining the weak values. We also describe some new (direct) methods (Non local weak measurements) for measuring the weak values of some non local variables.

quant-ph↗

Experimental realization of post-selected weak measurements on an NMR quantum processor

The ability to post-select the outcomes of an experiment is a useful theoretical concept and experimental tool. In the context of weak measurements post-selection can lead to surprising results such as complex weak values outside the range of eigenvalues. Usually post-selection is realized by a projective measurement, which is hard to implement in ensemble systems such as NMR. We demonstrate the first experiment of a weak measurement with post-selection on an NMR quantum information processor. Our setup is used for measuring complex weak values and weak values outside the range of eigenvalues. The scheme for overcoming the problem of post-selection in an ensemble quantum computer is general and can be applied to any circuit-based implementation. This experiment paves the way for studying and exploiting post-selection and weak measurements in systems where projective measurements are hard to realize experimentally.

quant-ph↗

Discord and quantum computational resources

Discordant states appear in a large number of quantum phenomena and seem to be a good indicator of divergence from classicality. While there is evidence that they are essential for a quantum algorithm to have an advantage over a classical one, their precise role is unclear. We examine the role of discord in quantum algorithms using the paradigmatic framework of `restricted distributed quantum gates' and show that manipulating discordant states using local operations has an associated cost in terms of entanglement and communication resources. Changing discord reduces the total correlations and reversible operations on discordant states usually require non-local resources. Discord alone is, however, not enough to determine the need for entanglement. A more general type of similar quantities, which we call K-discord, is introduced as a further constraint on the kinds of operations that can be performed without entanglement resources.

quant-ph↗