Pages that link to "Item:Q3455539"
From MaRDI portal
The following pages link to Dense quantum coding and quantum finite automata (Q3455539):
Displaying 42 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Two-tape finite automata with quantum and classical states (Q539559) (← links)
- Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities (Q670063) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Quantum information and the PCP theorem (Q835644) (← links)
- Quantum inductive inference by finite automata (Q924168) (← links)
- Quantum cryptography (Q975385) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Improved constructions of quantum automata (Q1017403) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- On the security of semi-device-independent QKD protocols (Q1993736) (← links)
- The randomness in \(2 \rightarrow 1\) quantum random access code without a shared reference frame (Q1994717) (← links)
- Semi-device-independent randomness certification with partially free random sources using \(4\rightarrow 1\) quantum random access code (Q2102243) (← links)
- The geometry of Bloch space in the context of quantum random access codes (Q2107101) (← links)
- Entropy accumulation (Q2206013) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Dense quantum coding and a lower bound for 1-way quantum automata (Q2819570) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- Separable states improve protocols with finite randomness (Q3386987) (← links)
- The learnability of quantum states (Q3508097) (← links)
- PRIVATE DATABASE QUERIES USING QUANTUM STATES WITH LIMITED COHERENCE TIMES (Q3634165) (← links)
- A quantum analog of Huffman coding (Q4503601) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Improved Constructions of Quantum Automata (Q5503296) (← links)
- Online learning of quantum states (Q5854122) (← links)
- Optimal bounds for parity-oblivious random access codes (Q5855036) (← links)
- Frame Potential in <i>CP<sup>n</sup></i> Some Numerical and Analytical Results (Q6042958) (← links)
- Advantage of Quantum Theory over Nonclassical Models of Communication (Q6065356) (← links)
- Expanding the sharpness parameter area based on sequential \(3 \rightarrow 1\) parity-oblivious quantum random access code (Q6101585) (← links)
- Two instances of random access code in the quantum regime (Q6556543) (← links)
- A review of quantum correlation sharing: the recycling of quantum correlations triggered by quantum measurements (Q6661834) (← links)