Pages that link to "Item:Q2819570"

The following pages link to Dense quantum coding and a lower bound for 1-way quantum automata (Q2819570):

Displaying 20 items.

• Oblivious transfer and quantum channels as communication resources (Q269051) (← links)
• Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities (Q670063) (← links)
• A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
• Two-way finite automata with quantum and classical states. (Q1853472) (← links)
• Quantum communication and complexity. (Q1853475) (← links)
• Characterizations of quantum automata (Q1884961) (← links)
• \(n\rightarrow 1\) quantum random access codes using single 3-level systems (Q2099610) (← links)
• The geometry of Bloch space in the context of quantum random access codes (Q2107101) (← links)
• Entropy accumulation (Q2206013) (← links)
• Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
• Semi-device-independent randomness expansion using \(n\rightarrow1\) sequential quantum random access codes (Q2685658) (← links)
• Separable states improve protocols with finite randomness (Q3386987) (← links)
• Dense quantum coding and quantum finite automata (Q3455539) (← links)
• (Q4782728) (← links)
• A general bound for the dimension of quantum behaviours in the prepare-and-measure scenario (Q5051638) (← links)
• Shadow Tomography of Quantum States (Q5130848) (← links)
• Optimal bounds for parity-oblivious random access codes (Q5855036) (← links)
• Source-device-independent randomness expansion using quantum random access codes (Q6098269) (← links)
• Expanding the sharpness parameter area based on sequential \(3 \rightarrow 1\) parity-oblivious quantum random access code (Q6101585) (← links)
• Semi-definite programming and quantum information (Q6561827) (← links)