2023
DOI: 10.1016/j.isci.2023.106306
|View full text |Cite
|
Sign up to set email alerts
|

Assisted quantum simulation of open quantum systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 78 publications
0
7
0
Order By: Relevance
“…However, while classical ASS schemes have substantial practical value, they rely on the computational complexity of classical encryption, making them potentially vulnerable to adversaries with strong computational capabilities, especially the upcoming quantum computers and fast quantum algorithms. 12 , 13 Fortunately, QASS addresses this issue while ensuring information-theoretic security.…”
Section: Introductionmentioning
confidence: 99%
“…However, while classical ASS schemes have substantial practical value, they rely on the computational complexity of classical encryption, making them potentially vulnerable to adversaries with strong computational capabilities, especially the upcoming quantum computers and fast quantum algorithms. 12 , 13 Fortunately, QASS addresses this issue while ensuring information-theoretic security.…”
Section: Introductionmentioning
confidence: 99%
“…A universal simulator requires an effective local Hamiltonian obeying the algebra of Pauli matrices, then encoded into qubits (quantum information, or QI) by a quantum circuit [54] . The reason is, Hamiltonian models of physical interest can be expressed in locally interacting spins, e.g., Ising and Heisenberg models [38 , 40 , 54] . The fidelity and probability for measuring spin type Hamiltonians, range from an open system exhibiting disorder in noisy channels, to models that use photons, sampled and slave particles [7 , 26 , 52] .…”
Section: Introductionmentioning
confidence: 99%
“…Examples for CFT are: A quantum double field (QDF) algorithm, called a QF lens coding algorithm (QF-LCA) [7] , [8] , [9] , [10] , [11] , [12] . A universal quantum algorithm (UQA) [38] listed for simulating open systems with expected success probability rates, when quantum-assisted on noisy intermediate-scale quantum (NISQ) devices [42] . From the four objectives, this qualifies as a QFCM, but not as a UQFCM.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations