• Corpus ID: 238744216

The Straddling Gates Problem in Multi-partite Quantum Systems

@article{Zhang2021TheSG,
  title={The Straddling Gates Problem in Multi-partite Quantum Systems},
  author={Yuxuan Zhang},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.06840}
}
  • Yuxuan Zhang
  • Published 13 October 2021
  • Computer Science, Physics
  • ArXiv
It is well known that an arbitrary n-qubit quantum state |Ψ〉 can be prepared with Θ(2) twoqubit gates [1], [2], [3], [4]. In this work, we investigate the task in a “straddling gates” scenario: consider n qubits divided equally into two sets and gates within each set are free; what is the least cost of two-qubit gates “straddling” the sets (also known as the “binding complexity”[5]) for preparing an arbitrary quantum state, assuming no ancilla qubits allowed? In this work, we give an algorithm… 

Figures from this paper

References

SHOWING 1-10 OF 21 REFERENCES
Elementary gates for quantum computation.
TLDR
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Smaller two-qubit circuits for quantum communication and computation
  • V. Shende, I. Markov, S. Bullock
  • Mathematics, Computer Science
    Proceedings Design, Automation and Test in Europe Conference and Exhibition
  • 2004
TLDR
This work shows how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts, and improves an earlier lower bound of 17 elementary gates by Bullock and Markov to 18.
Quantifying Entanglement
We have witnessed great advances in quantum information theory in recent years. There are two distinct directions in which progress is currently being made: quantum computation and error correction
Quantum circuits for general multiqubit gates.
TLDR
A generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits-a unitary transformation with 4(n) degrees of freedom is considered, and a method based on the so-called cosine-sine matrix decomposition is presented.
Three qubits can be entangled in two inequivalent ways
Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states. This classification concerns the entanglement properties of a single
Binding complexity and multiparty entanglement
A bstractWe introduce “binding complexity”, a new notion of circuit complexity which quantifies the difficulty of distributing entanglement among multiple parties, each consisting of many local
Quantum Computing in the NISQ era and beyond
TLDR
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.
Multiparticle entanglement and its applications to cryptography
Entanglement between three or more parties exhibits a realm of properties unknown to two-party states. Bipartite states are easily classified using the Schmidt decomposition. The Schmidt coefficients
Multipartite pure-state entanglement
We show that pure states of multipartite quantum systems are multiseparable (i.e., give separable density matrices on tracing any party) if and only if they have a generalized Schmidt decomposition.
Monogamy, Polygamy and other Properties of Entanglement of Purification
TLDR
It is shown that, in contrast to the quantum mutual information which is strictly monogamous for any tripartite pure states, the entanglement of purification is polygamous for the same, which shows that there can be genuinely two types of total correlation across any bipartite cross in a pure tri partite state.
...
1
2
3
...