Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
- URL: http://arxiv.org/abs/2209.02907v5
- Date: Thu, 7 Sep 2023 13:32:38 GMT
- Title: Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
- Authors: Satoshi Yoshida, Akihito Soeda, Mio Murao
- Abstract summary: We consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model.
In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation.
We show a method to reduce the large search space representing all possible protocols.
- Score: 0.9208007322096532
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We report a deterministic and exact protocol to reverse any unknown
qubit-unitary operation, which simulates the time inversion of a closed qubit
system. To avoid known no-go results on universal deterministic exact unitary
inversion, we consider the most general class of protocols transforming unknown
unitary operations within the quantum circuit model, where the input unitary
operation is called multiple times in sequence and fixed quantum circuits are
inserted between the calls. In the proposed protocol, the input qubit-unitary
operation is called 4 times to achieve the inverse operation, and the output
state in an auxiliary system can be reused as a catalyst state in another run
of the unitary inversion. We also present the simplification of the
semidefinite programming for searching the optimal deterministic unitary
inversion protocol for an arbitrary dimension presented by M. T. Quintino and
D. Ebler [Quantum $\textbf{6}$, 679 (2022)]. We show a method to reduce the
large search space representing all possible protocols, which provides a useful
tool for analyzing higher-order quantum transformations for unitary operations.
Related papers
- Reinforcement Learning to Disentangle Multiqubit Quantum States from Partial Observations [0.0]
We present a deep reinforcement learning approach to constructing short disentangling circuits for arbitrary 4-, 5-, and 6-qubit states.
We demonstrate the agent's ability to identify and exploit the entanglement structure of multiqubit states.
We report a general circuit to prepare an arbitrary 4-qubit state using at most 5 two-qubit (10 CNOT) gates.
arXiv Detail & Related papers (2024-06-12T05:23:08Z) - Universal adjointation of isometry operations using transformation of
quantum supermaps [0.9208007322096532]
We introduce isometry adjointation protocols that convert an input isometry operation into its adjoint operation.
We show that the optimal performance of general protocols in isometry adjointation and universal error detection is not dependent on the output dimension.
arXiv Detail & Related papers (2024-01-18T17:05:51Z) - Non-Local Multi-Qubit Quantum Gates via a Driven Cavity [0.0]
We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode.
The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits is required.
We provide estimates of gate fidelities and durations for atomic and molecular qubits coupled to optical or microwave cavities, and suggest applications for quantum error correction.
arXiv Detail & Related papers (2023-03-23T09:30:42Z) - Graph test of controllability in qubit arrays: A systematic way to
determine the minimum number of external controls [62.997667081978825]
We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits.
We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
arXiv Detail & Related papers (2022-12-09T12:59:44Z) - Two-Unitary Decomposition Algorithm and Open Quantum System Simulation [0.17126708168238122]
We propose a quantum two-unitary decomposition (TUD) algorithm to decompose a $d$-dimensional operator $A$ with non-zero singular values.
The two unitaries can be deterministically implemented, thus requiring only a single call to the state preparation oracle for each.
Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning.
arXiv Detail & Related papers (2022-07-20T16:09:28Z) - 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) - Universal construction of decoders from encoding black boxes [4.511923587827301]
We propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation.
For a qubit ($d=2$) encoded in $n$ qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method.
arXiv Detail & Related papers (2021-10-01T08:33:38Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Representation matching for delegated quantum computing [64.67104066707309]
representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network.
We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
arXiv Detail & Related papers (2020-09-14T18:07:43Z) - Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
Universal quantum computing with continuous variables requires non-Gaussian resources.
The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive.
We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
arXiv Detail & Related papers (2020-07-07T09:19:49Z)
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.