Experimental implementation of arbitrary entangled operations
- URL: http://arxiv.org/abs/2005.02640v1
- Date: Wed, 6 May 2020 08:01:23 GMT
- Title: Experimental implementation of arbitrary entangled operations
- Authors: Seongjin Hong, Chang Hoon Park, Yeon-Ho Choi, Yong-Su Kim, Young-Wook
Cho, Kyunghwan Oh, and Hyang-Tag Lim
- Abstract summary: We propose a scheme to realize arbitrary entangled operations based on a coherent superposition of local operations.
We experimentally implement several intriguing two-qubit entangled operations in photonic systems.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum entanglement lies at the heart of quantum mechanics in both
fundamental and practical aspects. The entanglement of quantum states has been
studied widely, however, the entanglement of operators has not been studied
much in spite of its importance. Here, we propose a scheme to realize arbitrary
entangled operations based on a coherent superposition of local operations.
Then, we experimentally implement several intriguing two-qubit entangled
operations in photonic systems. We also discuss the generalization of our
scheme to extend the number of superposed operations and the number of qubits.
Due to the simplicity of our scheme, we believe that it can reduce the
complexity or required resources of the quantum circuits and provide insights
to investigate properties of entangled operations.
Related papers
- Observation of disorder-free localization and efficient disorder averaging on a quantum processor [117.33878347943316]
We implement an efficient procedure on a quantum processor, leveraging quantum parallelism, to efficiently sample over all disorder realizations.
We observe localization without disorder in quantum many-body dynamics in one and two dimensions.
arXiv Detail & Related papers (2024-10-09T05:28:14Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Unambiguous discrimination of general quantum operations [14.537575399621572]
We experimentally demonstrate the optimal discrimination of up to 6 displacement operators and the unambiguous discrimination of non-unitary quantum operations.
Our results are expected to stimulate a wide range of valuable applications in the field of quantum sensing.
arXiv Detail & Related papers (2024-04-20T08:22:04Z) - Experimental topological quantum computing with electric circuits [5.093683847211242]
We report the first experimental realization of topological quantum computation with electric circuits.
Based on our proposed new scheme with circuits, Majorana-like edge states are observed experimentally.
We demonstrate the feasibility of topological quantum computing through a set of one- and two-qubit unitary operations.
arXiv Detail & Related papers (2023-09-09T23:25:46Z) - Quantum State Preparation and Non-Unitary Evolution with Diagonal
Operators [0.0]
We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices.
We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity.
We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
arXiv Detail & Related papers (2022-05-05T17:56:41Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - On coherence of quantum operations by using Choi-Jamio{\l}kowski
isomorphism [0.0]
Coherence of quantum operations can be considered as a quantum resource.
We study the coherence of quantum operations in the framework of resource theory.
arXiv Detail & Related papers (2022-01-03T09:04:10Z) - Detailed Account of Complexity for Implementation of Some Gate-Based
Quantum Algorithms [55.41644538483948]
In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself.
We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
arXiv Detail & Related papers (2021-06-23T16:33:33Z) - Implementation of hybridly protected quantum gates [2.3274138116397727]
We explore the implementation of hybridly protected quantum operations based on a simple and experimentally achievable spin model.
The protected quantum operations are controllable, well-suited for resolving various quantum tasks.
Our scheme is based on experimentally achievable Hamiltonian with reduced requirement of computational resources.
arXiv Detail & Related papers (2021-05-11T10:04:02Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Einselection from incompatible decoherence channels [62.997667081978825]
We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators.
We show that Fock states remain the most robust states to decoherence up to a critical coupling.
arXiv Detail & Related papers (2020-01-29T14:15:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.