Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFurther Compactifying Linear Optical Unitaries
96
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quantum integrated photonics requires large-scale linear optical circuitry, and for many applications it is desirable to have a universally programmable circuit, able to implement an arbitrary unitary transformation on a number of modes. This has been achieved using the Reck scheme, consisting of a network of Mach Zehnder interferometers containing a variable phase shifter in one path, as well as an external phase shifter after each Mach Zehnder. It subsequently became apparent that with symmetric Mach Zehnders containing a phase shift in both paths, the external phase shifts are redundant, resulting in a more compact circuit. The rectangular Clements scheme improves on the Reck scheme in terms of circuit depth, but it has been thought that an external phase-shifter was necessary after each Mach Zehnder. Here, we show that the Clements scheme can be realised using symmetric Mach Zehnders, requiring only a small number of external phase-shifters that do not contribute to the depth of the circuit. This will result in a significant saving in the length of these devices, allowing more complex circuits to fit onto a photonic chip, and reducing the propagation losses associated with these circuits. We also discuss how similar savings can be made to alternative schemes which have robustness to imbalanced beam-splitters.
rate research
Read More
Black-box quantum state preparation is a fundamental primitive in quantum algorithms. Starting from Grover, a series of techniques have been devised to reduce the complexity. In this work, we propose to perform black-box state preparation using the technique of linear combination of unitaries (LCU). We provide two algorithms based on a different structure of LCU. Our algorithms improve upon the existed best results by reducing the required additional qubits and Toffoli gates to 2log(n) and n, respectively, in the bit precision n. We demonstrate the algorithms using the IBM Quantum Experience cloud services. The further reduced complexity of the present algorithms brings the black-box quantum state preparation closer to reality.
We prove that every unitary acting on any multipartite system and having operator Schmidt rank equal to 2 can be diagonalized by local unitaries. This then implies that every such multipartite unitary is locally equivalent to a controlled unitary with every party but one controlling a set of unitaries on the last party. We also prove that any bipartite unitary of Schmidt rank 2 is locally equivalent to a controlled unitary where either party can be chosen as the control, and at least one party can control with two terms, which implies that each such unitary can be implemented using local operations and classical communication (LOCC) and a maximally entangled state on two qubits. These results hold regardless of the dimensions of the systems on which the unitary acts.
A highly anticipated use of quantum computers is the simulation of complex quantum systems including molecules and other many-body systems. One promising method involves directly applying a linear combination of unitaries (LCU) to approximate a Taylor series by truncating after some order. Here we present an adaptation of that method, optimized for Hamiltonians with terms of widely varying magnitude, as is commonly the case in electronic structure calculations. We show that it is more efficient to apply LCU using a truncation that retains larger magnitude terms as determined by an iterative procedure. We obtain bounds on the simulation error for this generalized truncated Taylor method, and for a range of molecular simulations we report these bounds as well as direct numerical emulation results. We find that our adaptive method can typically improve the simulation accuracy by an order of magnitude, for a given circuit depth.
Invariance under local unitary operations is a fundamental property that must be obeyed by every proper measure of quantum entanglement. However, this is not the only aspect of entanglement theory where local unitaries play a relevant role. In the present work we show that the application of suitable local unitary operations defines a family of bipartite entanglement monotones, collectively referred to as mirror entanglement. They are constructed by first considering the (squared) Hilbert-Schmidt distance of the state from the set of states obtained by applying to it a given local unitary. To the action of each different local unitary there corresponds a different distance. We then minimize these distances over the sets of local unitaries with different spectra, obtaining an entire family of different entanglement monotones. We show that these mirror entanglement monotones are organized in a hierarchical structure, and we establish the conditions that need to be imposed on the spectrum of a local unitary for the associated mirror entanglement to be faithful, i.e. to vanish on and only on separable pure states. We analyze in detail the properties of one particularly relevant member of the family, the stellar mirror entanglement associated to traceless local unitaries with nondegenerate spectrum and equispaced eigenvalues in the complex plane. This particular measure generalizes the original analysis of [Giampaolo and Illuminati, Phys. Rev. A 76, 042301 (2007)], valid for qubits and qutrits. We prove that the stellar entanglement is a faithful bipartite entanglement monotone in any dimension, and that it is bounded from below by a function proportional to the linear entropy and from above by the linear entropy itself, coinciding with it in two- and three-dimensional spaces.
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $varepsilon$-approximations using circuits of length $O(log(1/varepsilon))$, which is asymptotically optimal. The algorithm achieves the same quality of approximation as previously-known algorithms for Clifford+T [arXiv:1212.6253], V-basis [arXiv:1303.1411] and Clifford+$pi/12$ [arXiv:1409.3552], running on average in time polynomial in $O(log(1/varepsilon))$ (conditional on a number-theoretic conjecture). Ours is the first such algorithm that works for a wide range of gate sets and provides insight into what should constitute a good gate set for a fault-tolerant quantum computer.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
