arXiv subjects
Publications and source records attributed to Barry C. Sanders.
We construct a decomposition procedure for converting split-step quantum walks into ordinary quantum walks with alternating coins, and we show that this decomposition enables a feasible linear optical realization of split-step quantum walks by eliminating quantum-control requirements. As salient applications, we show how our scheme will simulate Majorana modes and edge states.
We characterize surface-plasmon polaritons at lossy planar interfaces between one dispersive and one nondispersive linear isotropic homogeneous media, i.e., materials or metamaterials. Specifically we solve Maxwell's equations to obtain strict bounds for the permittivity and permeability of these media such that satisfying these bounds implies surface-plasmon polaritons successfully propagate at the interface, and violation of the bounds impedes propagation, i.e., the field delocalizes from the surface into the bulk. Our characterization of surface-plasmon polaritons is valuable for checking viability of a proposed application, and, as an example, we employ our method to falsify a previous prediction that surface-plasmon propagation through a surface of a double-negative refractive index medium occurs for any permittivity and permeability; instead we show that propagation can occur only for certain medium parameters.
Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported quantum channel simulator consists of four single-qubit gates and one controlled-NOT gate. All types of quantum channels can be decomposed by the algorithm and implemented on this device. We deploy our system to simulate various quantum channels, such as quantum-noise channels and weak quantum measurement. Our results advance experimental quantum channel simulation, which is integral to the goal of quantum information processing.
We propose an optical scheme, employing optical parametric down-converters interlaced with nonlinear sign gates (NSGs), that completely converts an $n$-photon Fock-state pump to $n$ signal-idler photon pairs when the down-converters' crystal lengths are chosen appropriately. The proof of this assertion relies on amplitude amplification, analogous to that employed in Grover search, applied to the full quantum dynamics of single-mode parametric down-conversion. When we require that all Grover iterations use the same crystal, and account for potential experimental limitations on crystal-length precision, our optimized conversion efficiencies reach unity for $1\le n \le 5$, after which they decrease monotonically for $n$ values up to 50, which is the upper limit of our numerical dynamics evaluations. Nevertheless, our conversion efficiencies remain higher than those for a conventional (no NSGs) down-converter.
We establish strict upper bounds on local quantum uncertainty (LQU) and skew information associated with state conversion via certain quantum channels. Specifically, we obtain a bound on the achievable LQU for bipartite channels whose Kraus operators commute with nondegenerate von Neumann measurements on the first subsystem, and this LQU bound is expressed in terms of the skew information for the first subsystem. Furthermore, we establish a bound on the skew information of one subsystem obtained from any initial bipartite state subject to any quantum steering channel, and this bound is expressed in terms of the LQU for the initial joint-system state. Our two claims show that state conversion has fundamental limitations relating LQU with skew information.
We present a theory of cooperative light scattering valid in any dimension: connecting theories for an open line, open plane, and open space in the non-relativistic regime. This theory includes near-field and dipole-orientation effects, highlighting how field mode confinement controls the phenomena. We present a novel experimental implementation for planar collective effects.
Quantum control is valuable for various quantum technologies such as high-fidelity gates for universal quantum computing, adaptive quantum-enhanced metrology, and ultra-cold atom manipulation. Although supervised machine learning and reinforcement learning are widely used for optimizing control parameters in classical systems, quantum control for parameter optimization is mainly pursued via gradient-based greedy algorithms. Although the quantum fitness landscape is often compatible with greedy algorithms, sometimes greedy algorithms yield poor results, especially for large-dimensional quantum systems. We employ differential evolution algorithms to circumvent the stagnation problem of non-convex optimization. We improve quantum control fidelity for noisy system by averaging over the objective function. To reduce computational cost, we introduce heuristics for early termination of runs and for adaptive selection of search subspaces. Our implementation is massively parallel and vectorized to reduce run time even further. We demonstrate our methods with two examples, namely quantum phase estimation and quantum gate design, for which we achieve superior fidelity and scalability than obtained using greedy algorithms.
The theory of relativity requires that no information travel faster than light, whereas the unitarity of quantum mechanics ensures that quantum information cannot be cloned. These conditions provide the basic constraints that appear in information replication tasks, which formalize aspects of the behavior of information in relativistic quantum mechanics. In this article, we provide continuous variable (CV) strategies for spacetime quantum information replication that are directly amenable to optical or mechanical implementation. We use a new class of homologically-constructed CV quantum error correcting codes to provide efficient solutions for the general case of information replication. As compared to schemes encoding qubits, our CV solution requires half as many shares per encoded system. We also provide an optimized five-mode strategy for replicating quantum information in a particular configuration of four spacetime regions designed not to be reducible to previously performed experiments. For this optimized strategy, we provide detailed encoding and decoding procedures using standard optical apparatus and calculate the recovery fidelity when finite squeezing is used. As such we provide a scheme for experimentally realizing quantum information replication using quantum optics.
Three-qubit quantum gates are key ingredients for quantum error correction and quantum information processing. We generate quantum-control procedures to design three types of three-qubit gates, namely Toffoli, Controlled-Not-Not and Fredkin gates. The design procedures are applicable to a system comprising three nearest-neighbor-coupled superconducting artificial atoms. For each three-qubit gate, the numerical simulation of the proposed scheme achieves 99.9% fidelity, which is an accepted threshold fidelity for fault-tolerant quantum computing. We test our procedure in the presence of decoherence-induced noise as well as show its robustness against random external noise generated by the control electronics. The three-qubit gates are designed via the machine learning algorithm called Subspace-Selective Self-Adaptive Differential Evolution (SuSSADE).
We present our approach for sharing photons and assessing resultant four-photon visibility between two distant parties using concatenated entanglement swapping. In addition we determine the corresponding key generation rate and the quantum bit-error rate. Our model is based on practical limitations of resources, including multipair parametric down-conversion sources, inefficient detectors with dark counts and lossy channels. Through this approach, we have found that a trade-off is needed between experimental run-time, pair-production rate and detector efficiency. Concatenated entanglement swapping enables huge distances for quantum key-distribution but at the expense of low key generation rate.
Cat states are coherent quantum superpositions of macroscopically distinct states and are useful for understanding the boundary between the classical and the quantum world. Due to their macroscopic nature, cat states are difficult to prepare in physical systems. We propose a method to create cat states in one-dimensional quantum walks using delocalized initial states of the walker. Since the quantum walks can be performed on any quantum system, our proposal enables a platform-independent realization of the cat states. We further show that the linear dispersion relation of the effective quantum walk Hamiltonian, which governs the dynamics of the delocalized states, is responsible for the formation of the cat states. We analyze the robustness of these states against environmental interactions and present methods to control and manipulate the cat states in the photonic implementation of quantum walks.
Quantum-enhanced metrology aims to estimate an unknown parameter such that the precision scales better than the shot-noise bound. Single-shot adaptive quantum-enhanced metrology (AQEM) is a promising approach that uses feedback to tweak the quantum process according to previous measurement outcomes. Techniques and formalism for the adaptive case are quite different from the usual non-adaptive quantum metrology approach due to the causal relationship between measurements and outcomes. We construct a formal framework for AQEM by modeling the procedure as a decision-making process, and we derive the imprecision and the Cramér-Rao lower bound with explicit dependence on the feedback policy. We also explain the reinforcement learning approach for generating quantum control policies, which is adopted due to the optimal policy being non-trivial to devise. Applying a learning algorithm based on differential evolution enables us to attain imprecision for adaptive interferometric phase estimation, which turns out to be SQL when non-entangled particles are used in the scheme.
We explore the crucial role of relative space-time positioning between the two detectors in an operational two-party entanglement-harvesting protocol. Specifically we show that the protocol is robust if imprecision in spatial positioning and clock synchronization are much smaller than the spatial separation between the detectors and its light-crossing time thereof. This in principle guarantees robustness if the imprecision is comparable to a few times the size of the detectors, which suggests entanglement harvesting could be explored for tabletop experiments. On the other hand, keeping the effects of this imprecision under control would be demanding on astronomical scales.
We realize a pair of simultaneous ten-step one-dimensional quantum walks with two walkers sharing coins, which we prove is analogous to the ten-step two-dimensional quantum walk with a single walker holding a four-dimensional coin. Our experiment demonstrates a ten-step quantum walk over an 11x11 two-dimensional lattice with a line defect, thereby realizing a localized walker state.
In this paper, we employ the properties of metamaterials to tailor the modes of metamaterial-dielectric waveguides operating at optical frequencies. We survey the effect of fishnet metamaterial structural parameters such as the magnetic oscillation strength, magnetic resonance frequency and magnetic damping on the double-negative refractive index frequency region in metamaterials and on the hybrid-modes in slab metamaterial-dielectric waveguides. To identify the robustness of the metamaterials to fluctuations in the metamaterial structural parameters, we investigate the behavior of metamaterials under Gaussian errors on their structural parameters. Our survey enables the identification of appropriate metamaterial unit-cell structure and the permissive fluctuations on the structural parameters for further applications of metamaterials in waveguide technologies.
We combine single- and two-photon interference procedures for characterizing any multi-port linear optical interferometer accurately and precisely. Accuracy is achieved by estimating and correcting systematic errors that arise due to spatiotemporal and polarization mode mismatch. Enhanced accuracy and precision are attained by fitting experimental coincidence data to curve simulated using measured source spectra. We employ bootstrapping statistics to quantify the resultant degree of precision. A scattershot approach is devised to effect a reduction in the experimental time required to characterize the interferometer. The efficacy of our characterization procedure is verified by numerical simulations.
We devise a scalable scheme for simulating a quantum phase transition from paramagnetism to frustrated magnetism in a superconducting flux-qubit network, and we show how to characterize this system experimentally both macroscopically and microscopically. The proposed macroscopic characterization of the quantum phase transition is based on the transition of the probability distribution for the spin-network net magnetic moment with this transition quantified by the difference between the Kullback-Leibler divergences of the distributions corresponding to the paramagnetic and frustrated magnetic phases with respect to the probability distribution at a given time during the transition. Microscopic characterization of the quantum phase transition is performed using the standard local-entanglement-witness approach. Simultaneous macro and micro characterizations of quantum phase transitions would serve to verify a quantum phase transition in two ways especially in the quantum realm for the classically intractable case of frustrated quantum magnetism.
We develop a theory for long-distance quantum key distribution based on concatenated entanglement swapping using parametric down-conversion sources and show numerical results of our model. The model incorporates practical resources including multi-pair sources, inefficient detectors with dark counts and lossy channels. We calculate the maximum secret key-generation ratefor up to three entanglement swapping stations by optimizing over resource parameters, and our numerical simulation shows that the range of quantum key distribution can in principle be markedly increased but at the expense of an atrociously unfeasible secret key-generation rate; however, the upper bound of our key rates closely approach the Takeoka-Guha-Wilde upper bound. Our analysis demonstrates the need for new technology such as quantum memory to synchronize photons and our methods should serve as a valuable component for accurately modelling quantum-memory-based long-distance quantum key distribution.