Unanswered Questions
226 questions with no upvoted or accepted answers
15
votes
0
answers
679
views
Relation between quantum entanglement and quantum state complexity
Both quantum entanglement and quantum state complexity are important in quantum information processing. They are usually highly correlated, i.e., roughly a state with a higher entanglement corresponds ...
- 1,502
13
votes
0
answers
308
views
Is HHL still BQP-complete when the matrix entries are only in {0,1}?
I'm studying BQP-completeness proofs of a number of interesting problems of Janzing and Wocjan, and Wocjan and Zhang. Janzing and Wocjan show that estimating entries of matrix powers $(A^m)_{ij}$ with ...
- 12.4k
12
votes
0
answers
347
views
What is the Generalized Quantum Stein's Lemma and why is it important?
I'm sensing a lot of buzz about potential re-proofs of the Generalized Quantum Stein's Lemma - a generalization of the quantum counterpart to the classical Stein's Lemma, which is of some importance ...
- 14.4k
11
votes
0
answers
143
views
Are there separable $\rho$ that cannot be decomposed with less than $\operatorname{rank}(\rho)^2$ pure product states?
In What separable $\rho$ only admit separable pure decompositions with more than $\mathrm{rank}(\rho)$ terms?, examples were given of separable states $\rho$ with separable decompositions requiring ...
glS♦
- 26.9k
11
votes
0
answers
207
views
Estimate/determine Bures separability probabilities making use of corresponding Hilbert-Schmidt probabilities
For two-qubit states, represented by a $4\times 4$ density matrix, the generic state is described by 15 real parameters. For ease of calculation, it can help to consider restricted families of states, ...
- 24.8k
11
votes
1
answer
195
views
Empirical Algorithmics for Near-Term Quantum Computing
In Empirical Algorithmics, researchers aim to understand the performance of algorithms through analyzing their empirical performance. This is quite common in machine learning and optimization. Right ...
- 1,993
10
votes
0
answers
110
views
Entanglement-assisted hashing bound for asymmetric depolarizing channels
I reading the paper EXIT-Chart Aided Quantum Code Design
Improves the Normalised Throughput
of Realistic Quantum Devices, which proposes the use of QTCs in order to do quantum error correction for ...
glS♦
- 26.9k
10
votes
0
answers
146
views
Strong vs weak simulations and the polynomial hierarchy collapse
(Edited to make the argument and the question more precise)
An argument for quantum computational "supremacy" (specifically in Bremner et al. and the Google paper) assumes that there exists a ...
- 201
10
votes
0
answers
219
views
Entanglement transfer of spin-entangled triplet-pair states between flying qubits and stationary qubits
The context: We are in the solid state. After a photon absortion by a system with a singlet ground state, the system undergoes the spin-conserving fission of one spin singlet exciton into two spin ...
9
votes
0
answers
430
views
Is there a BQP algorithm for each level of the polynomial hierarchy PH?
This question is inspired by thinking about quantum computing power with respect to games, such as chess/checkers/other toy games. Games fit naturally into the polynomial hierarchy $\mathrm{PH}$; I'm ...
- 14.4k
8
votes
0
answers
286
views
Five qubits can be entangled in how many ways?
It is well-known that there are two ways to entangle three qubits and nine ways to entangle four qubits.
In page 22 of this paper I found that there are infinitely many ways to entangle five qubits, ...
- 3,494
8
votes
0
answers
139
views
Query on Reduced Graph States
Reduced graph states are characterized as follows (from page 46 of this paper): Let $A \subseteq V$ be a subset of vertices of a graph $G = (V,E)$ and $B = V\setminus A$ the complement of $A$ in $V$. ...
- 24.8k
8
votes
0
answers
202
views
Better "In-Place" Amplification of QMA
$\def\braket#1#2{\langle#1|#2\rangle}\def\bra#1{\langle#1|}\def\ket#1{|#1\rangle}$
In MW05 the authors demonstrate so-called "in-place" amplitude amplification for QMA, exhibiting a method for Arthur ...
glS♦
- 26.9k
8
votes
0
answers
262
views
How can blackholes be fast information scramblers?
I noticed that there was already a post discussing the fast scrambling property of black holes. But it seems no satisfactory answer was given.
As mentioned by L. Susskind et. al, the fast scrambling ...
glS♦
- 26.9k
7
votes
0
answers
337
views
What is the motivation for Weyl matrices in quantum information theory?
Quantum Entanglement and Geometry — Andreas Gabriel (2010) — Sec: 2.3.4 ~p. 11
Another basis for $d\times d$-dimensional matrices that has proven to be quite useful in quantum information theory is ...
- 397