scholarly journals Universal control of quantum processes using sector-preserving channels

2021 ◽  
Vol 21 (15&16) ◽  
pp. 1320-1352
Author(s):  
Augustin Vanrietvelde ◽  
Giulio Chiribella
Keyword(s):  
Quantum Channel ◽  
Coherent Control ◽  
Quantum Circuit ◽  
Compact Representation ◽  
Dimensional System ◽  
Quantum Processes ◽  
Information Theoretic ◽  
Higher Dimensional ◽  
Standard Notion ◽  
Arbitrary Quantum

No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we formalise the task achieved by these experiments, extending it to the control of arbitrary noisy channels, and to more general types of control involving higher dimensional control systems. For the standard notion of coherent control, we identify the information-theoretic resource for controlling an arbitrary quantum channel on a $d$-dimensional system: specifically, the resource is an extended quantum channel acting as the original channel on a $d$-dimensional sector of a $(d+1)$-dimensional system. Using this resource, arbitrary controlled channels can be built with a universal circuit architecture. We then extend the standard notion of control to more general notions, including control of multiple channels with possibly different input and output systems. Finally, we develop a theoretical framework, called supermaps on routed channels, which provides a compact representation of coherent control as an operation performed on the extended channels, and highlights the way the operation acts on different sectors.

scholarly journals Inverse-square law between time and amplitude for crossing tipping thresholds

2019 ◽  
Vol 475 (2222) ◽  
pp. 20180504 ◽  
Author(s):  
Paul Ritchie ◽  
Özkan Karabacak ◽  
Jan Sieber
Keyword(s):  
Dynamical System ◽  
Feedback Loop ◽  
Tipping Point ◽  
Dimensional System ◽  
Stochastic Forcing ◽  
Inverse Square Law ◽  
System A ◽  
Asymptotic Expressions ◽  
Higher Dimensional ◽  
Random Disturbances

A classical scenario for tipping is that a dynamical system experiences a slow parameter drift across a fold tipping point, caused by a run-away positive feedback loop. We study what happens if one turns around after one has crossed the threshold. We derive a simple criterion that relates how far the parameter exceeds the tipping threshold maximally and how long the parameter stays above the threshold to avoid tipping in an inverse-square law to observable properties of the dynamical system near the fold. For the case when the dynamical system is subject to stochastic forcing we give an approximation to the probability of tipping if a parameter changing in time reverses near the tipping point. The derived approximations are valid if the parameter change in time is sufficiently slow. We demonstrate for a higher-dimensional system, a model for the Indian summer monsoon, how numerically observed escape from the equilibrium converge to our asymptotic expressions. The inverse-square law between peak of the parameter forcing and the time the parameter spends above a given threshold is also visible in the level curves of equal probability when the system is subject to random disturbances.

scholarly journals Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits

2021 ◽  
Author(s):  
Matthew Coudron ◽  
Jalex Stark ◽  
Thomas Vidick
Keyword(s):  
Linear Time ◽  
Bell Inequality ◽  
Quantum Circuit ◽  
Constant Depth ◽  
Information Theoretic ◽  
Small Constant ◽  
Fundamental Information ◽  
Simple Quantum ◽  
Variation Distance ◽  
Noise Tolerant

AbstractThe generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion using a single quantum device. The protocol calls for the device to implement a simple quantum circuit of constant depth on a 2D lattice of qubits. The output of the circuit can be verified classically in linear time, and is guaranteed to contain a polynomial number of certified random bits assuming that the device used to generate the output operated using a (classical or quantum) circuit of sub-logarithmic depth. This assumption contrasts with the locality assumption used for randomness certification based on Bell inequality violation and more recent proposals for randomness certification based on computational assumptions. Furthermore, to demonstrate randomness generation it is sufficient for a device to sample from the ideal output distribution within constant statistical distance. Our procedure is inspired by recent work of Bravyi et al. (Science 362(6412):308–311, 2018), who introduced a relational problem that can be solved by a constant-depth quantum circuit, but provably cannot be solved by any classical circuit of sub-logarithmic depth. We develop the discovery of Bravyi et al. into a framework for robust randomness expansion. Our results lead to a new proposal for a demonstrated quantum advantage that has some advantages compared to existing proposals. First, our proposal does not rest on any complexity-theoretic conjectures, but relies on the physical assumption that the adversarial device being tested implements a circuit of sub-logarithmic depth. Second, success on our task can be easily verified in classical linear time. Finally, our task is more noise-tolerant than most other existing proposals that can only tolerate multiplicative error, or require additional conjectures from complexity theory; in contrast, we are able to allow a small constant additive error in total variation distance between the sampled and ideal distributions.

scholarly journals Coupling a single electron on superfluid helium to a superconducting resonator

2019 ◽  
Vol 10 (1) ◽  
Author(s):  
Gerwin Koolstra ◽  
Ge Yang ◽  
David I. Schuster
Keyword(s):  
Quantum Electrodynamics ◽  
Coherent Control ◽  
Single Electron ◽  
Strong Interactions ◽  
Dimensional System ◽  
Trapped Electrons ◽  
Electrons On Helium ◽  
Single Electrons ◽  
Microwave Regime ◽  
Electron Photon

AbstractElectrons on helium form a unique two-dimensional system on the interface of liquid helium and vacuum. A small number of trapped electrons on helium exhibits strong interactions in the absence of disorder, and can be used as a qubit. Trapped electrons typically have orbital frequencies in the microwave regime and can therefore be integrated with circuit quantum electrodynamics (cQED), which studies light–matter interactions using microwave photons. Here, we experimentally realize a cQED platform with the orbitals of single electrons on helium. We deterministically trap one to four electrons in a dot integrated with a microwave resonator, allowing us to study the electrons’ response to microwaves. Furthermore, we find a single-electron-photon coupling strength of $$g/2\pi =4.8\pm 0.3$$g∕2π=4.8±0.3 MHz, greatly exceeding the resonator linewidth $$\kappa /2\pi =0.5$$κ∕2π=0.5 MHz. These results pave the way towards microwave studies of Wigner molecules and coherent control of the orbital and spin state of a single electron on helium.

scholarly journals Revealing topology with transformation optics

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Lizhen Lu ◽  
Kun Ding ◽  
Emanuele Galiffi ◽  
Xikui Ma ◽  
Tianyu Dong ◽  
...  
Keyword(s):  
Physical Space ◽  
Real Space ◽  
Virtual Space ◽  
Transformation Optics ◽  
Coordinate Space ◽  
Dimensional System ◽  
Edge States ◽  
And Topology ◽  
Higher Dimensional ◽  
Insight Into

AbstractSymmetry deepens our insight into a physical system and its interplay with topology enables the discovery of topological phases. Symmetry analysis is conventionally performed either in the physical space of interest, or in the corresponding reciprocal space. Here we borrow the concept of virtual space from transformation optics to demonstrate how a certain class of symmetries can be visualised in a transformed, spectrally related coordinate space, illuminating the underlying topological transitions. By projecting a plasmonic system in a higher-dimensional virtual space onto a lower-dimensional system in real space, we show how transformation optics allows us to construct a topologically non-trivial system by inspecting its modes in the virtual space. Interestingly, we find that the topological invariant can be controlled via the singularities in the conformal mapping, enabling the intuitive engineering of edge states. The confluence of transformation optics and topology here can be generalized to other wave realms beyond photonics.

Non-Standard Reduction of Noisy Structural Systems: Shallow Arches

2000 ◽  
Author(s):  
Lalit Vedula ◽  
N. Sri Namachchivaya
Keyword(s):  
Markov Process ◽  
Random Perturbation ◽  
Exit Time ◽  
Stochastic Averaging ◽  
Dimensional System ◽  
Shallow Arches ◽  
Higher Dimensional ◽  
Mean Exit Time ◽  
Stationary Probability Density Function ◽  
Low Dimensional

Abstract The dynamics of a shallow arch subjected to small random external and parametric excitation is invegistated in this work. We develop rigorous methods to replace, in some limiting regime, the original higher dimensional system of equations by a simpler, constructive and rational approximation – a low-dimensional model of the dynamical system. To this end, we study the equations as a random perturbation of a two-dimensional Hamiltonian system. We achieve the model-reduction through stochastic averaging and the reduced Markov process takes its values on a graph with certain glueing conditions at the vertex of the graph. Examination of the reduced Markov process on the graph yields many important results such as mean exit time, stationary probability density function.

Robust variations of secret sharing through noisy quantum channel

2014 ◽  
Vol 14 (7&8) ◽  
pp. 589-607
Author(s):  
Xiu-Bo Chen ◽  
Gang Xu ◽  
Yuan Su ◽  
Yi-Xian Yang
Keyword(s):  
Secret Sharing ◽  
Quantum Channel ◽  
Security Analysis ◽  
Information Leakage ◽  
Quantum Secret Sharing ◽  
The Other ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Fundamental Requirement ◽  
Noisy Quantum Channel

In this paper, the perfect secret sharing in quantum cryptography is investigated. On one hand, the security of a recent protocol [Adhikari et al. Quantum Inform. \& Comput. 12 (2012) 0253-0261] is re-examined. We find that it violates the requirement of information theoretic security in the secret sharing and suffers from the information leakage. The cryptanalysis including several specific attack strategies are given, which shows that a dishonest participant can steal half or all of the secrets without being detected. On the other hand, we design a new quantum secret sharing protocol. The security of protocol is rigorously proved. It meets the fundamental requirement of information theoretic security. Furthermore, the security analysis including both the outside attacks and participant attacks is given in details. It is shown that our proposed protocol can achieve perfect secret sharing.

scholarly journals Quantum Generative Adversarial Networks for learning and loading random distributions

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Christa Zoufal ◽  
Aurélien Lucchi ◽  
Stefan Woerner
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
Quantum Algorithms ◽  
Probability Distributions ◽  
Quantum Algorithm ◽  
Quantum Circuit ◽  
Quantum Simulation ◽  
Quantum States ◽  
Generative Adversarial Networks ◽  
Adversarial Networks

AbstractQuantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $${\mathcal{O}}\left({2}^{n}\right)$$O2n gates to load an exact representation of a generic data structure into an $$n$$n-qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state loading. More precisely, we use quantum Generative Adversarial Networks (qGANs) to facilitate efficient learning and loading of generic probability distributions - implicitly given by data samples - into quantum states. Through the interplay of a quantum channel, such as a variational quantum circuit, and a classical neural network, the qGAN can learn a representation of the probability distribution underlying the data samples and load it into a quantum state. The loading requires $${\mathcal{O}}\left(poly\left(n\right)\right)$$Opolyn gates and can thus enable the use of potentially advantageous quantum algorithms, such as Quantum Amplitude Estimation. We implement the qGAN distribution learning and loading method with Qiskit and test it using a quantum simulation as well as actual quantum processors provided by the IBM Q Experience. Furthermore, we employ quantum simulation to demonstrate the use of the trained quantum channel in a quantum finance application.

Targeting Applying ε-Bounded Orbit Correction Perturbations

1998 ◽  
Vol 08 (07) ◽  
pp. 1575-1584 ◽  
Author(s):  
M. S. Baptista
Keyword(s):  
Dimensional System ◽  
Fast Computation ◽  
Orbit Correction ◽  
Higher Dimensional ◽  
Starting Point

A low-sized chaotic trajectory is used to compute epsilon-bounded orbit correction perturbations in order to rapidly target a trajectory from the vicinity of a starting point to a target. An algorithm that allows fast computation of a set of perturbations to be applied is presented, and its performance is tested in a higher-dimensional system, the kicked double rotor.

scholarly journals Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering

2019 ◽  
Author(s):  
Bertrand Charpentier ◽  
Thomas Bonald
Keyword(s):  
Hierarchical Clustering ◽  
Hierarchical Structure ◽  
Probability Distributions ◽  
Fundamental Property ◽  
Information Loss ◽  
Perfect Reconstruction ◽  
Compact Representation ◽  
Information Theoretic ◽  
Graph Reconstruction ◽  
Leibler Divergence

We introduce the tree sampling divergence (TSD), an information-theoretic metric for assessing the quality of the hierarchical clustering of a graph. Any hierarchical clustering of a graph can be represented as a tree whose nodes correspond to clusters of the graph. The TSD is the Kullback-Leibler divergence between two probability distributions over the nodes of this tree: those induced respectively by sampling at random edges and node pairs of the graph. A fundamental property of the proposed metric is that it is interpretable in terms of graph reconstruction. Specifically, it quantifies the ability to reconstruct the graph from the tree in terms of information loss. In particular, the TSD is maximum when perfect reconstruction is feasible, i.e., when the graph has a complete hierarchical structure. Another key property of TSD is that it applies to any tree, not necessarily binary. In particular, the TSD can be used to compress a binary tree while minimizing the information loss in terms of graph reconstruction, so as to get a compact representation of the hierarchical structure of a graph. We illustrate the behavior of TSD compared to existing metrics on experiments based on both synthetic and real datasets.

scholarly journals Memory effects in quantum processes

2020 ◽  
Vol 18 (02) ◽  
pp. 1941002 ◽  
Author(s):  
Philip Taranto
Keyword(s):  
Quantum Mechanics ◽  
Coherent Control ◽  
Probability Distributions ◽  
Joint Probability ◽  
Memory Effects ◽  
Structural Constraints ◽  
Quantum Processes ◽  
Quantum Process ◽  
Classical Counterpart ◽  
Classical Setting

Understanding temporal processes and their correlations in time is of paramount importance for the development of near-term technologies that operate under realistic conditions. Capturing the complete multi-time statistics that define a stochastic process lies at the heart of any proper treatment of memory effects. This is well understood in classical theory, where a hierarchy of joint probability distributions completely characterizes the process at hand. However, attempting to generalize this notion to quantum mechanics is problematic: observing realizations of a quantum process necessarily disturbs the state of the system, breaking an implicit, and crucial, assumption in the classical setting. This issue can be overcome by separating the experimental interventions from the underlying process, enabling an unambiguous description of the process itself and accounting for all possible multi-time correlations for any choice of interrogating instruments. In this paper, using a novel framework for the characterization of quantum stochastic processes, we first solve the long standing question of unambiguously describing the memory length of a quantum processes. This is achieved by constructing a quantum Markov order condition, which naturally generalizes its classical counterpart for the quantification of finite-length memory effects. As measurements are inherently invasive in quantum mechanics, one has no choice but to define Markov order with respect to the interrogating instruments that are used to probe the process at hand: different memory effects are exhibited depending on how one addresses the system, in contrast to the standard classical setting. We then fully characterize the structural constraints imposed on quantum processes with finite Markov order, shedding light on a variety of memory effects that can arise through various examples. Finally, we introduce an instrument-specific notion of memory strength that allows for a meaningful quantification of the temporal correlations between the history and the future of a process for a given choice of experimental intervention. These findings are directly relevant to both characterizing and exploiting memory effects that persist for a finite duration. In particular, immediate applications range from developing efficient compression and recovery schemes for the description of quantum processes with memory to designing coherent control protocols that efficiently perform information-theoretic tasks, amongst a plethora of others.

Sign in / Sign up

Export Citation Format

Share Document