Pages that link to "Item:Q4861260"

The following pages link to Universality in quantum computation (Q4861260):

Displaying 50 items.

• \textit{OptQC}: an optimized parallel quantum compiler (Q525744) (← links)
• A geometric algebra perspective on quantum computational gates and universality in quantum computing (Q640373) (← links)
• Quantum MIMO communication scheme based on quantum teleportation with triplet states (Q641709) (← links)
• Quantum correlations in systems of indistinguishable particles (Q699085) (← links)
• Quantum computation using the Aharonov-Casher set up (Q701195) (← links)
• Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
• Avoiding loss of fidelity for universal entangling geometric quantum gate (Q1037329) (← links)
• Quantum implicit computational complexity (Q1044836) (← links)
• Holonomic quantum computation (Q1569451) (← links)
• Quantum computation based on retarded and advanced propagation. (Q1586917) (← links)
• Quantum limit on computational time and speed (Q1612817) (← links)
• A facile two-step method to implement \(N\sqrt {i\text{SWAP}}\) and \(N\sqrt {\text{SWAP}}\) gates in a circuit QED (Q1616486) (← links)
• Universality of single-qudit gates (Q1683949) (← links)
• Quantum security computation on shared secrets (Q1740928) (← links)
• Geometric phases and quantum computations (Q1847705) (← links)
• Quantum computation by measurement and quantum memory (Q1858100) (← links)
• Common entanglement witnesses and their characteristics (Q1937222) (← links)
• Time-optimal decompositions in \(\mathrm{SU}(2)\) (Q1952605) (← links)
• A Hamiltonian for quantum copying (Q1968158) (← links)
• Towards quantum computing based community detection (Q2065973) (← links)
• Models of quantum computation and quantum programming languages (Q2250909) (← links)
• Observable-geometric phases and quantum computation (Q2308423) (← links)
• Quantum information in the Posner model of quantum cognition (Q2318790) (← links)
• A proposal for the realization of universal quantum gates via superconducting qubits inside a cavity (Q2442319) (← links)
• Hamiltonian quantum dynamics with separability constraints (Q2467706) (← links)
• Compiling quantum programs (Q2484067) (← links)
• Quantization of games: towards quantum artificial intelligence (Q2503269) (← links)
• Quantum circuits synthesis using Householder transformations (Q2698830) (← links)
• (Q2706735) (← links)
• On the universality of almost every quantum logic gate (Q2737818) (← links)
• Neural networks with quantum architecture and quantum learning (Q3012783) (← links)
• Quantum information with continuous variables (Q3077082) (← links)
• Unitary Transformations Can Be Distinguished Locally (Q3107740) (← links)
• Implementing scalable quantum computation with cavities (Q3151823) (← links)
• Quantum computation and quantum information† (Q3375535) (← links)
• Analytic controllability of time-dependent quantum control systems (Q3438385) (← links)
• GENERATING QUANTUM ENTANGLEMENT IN SCALABLE SUPERCONDUCTING CHARGE QUBITS (Q3503060) (← links)
• A rigorous approach to the Feynman-Vernon influence functional and its applications. I (Q3544458) (← links)
• QUANTUM HOLONOMIES FOR QUANTUM COMPUTING (Q3583529) (← links)
• CONTROL OF QUANTUM SYSTEMS (Q4453804) (← links)
• Simulation and reversal of n -qubit Hamiltonians using Hadamard matrices (Q4463571) (← links)
• Tight Binding Hamiltonians and Quantum Turing Machines (Q4492438) (← links)
• Quantum Computation over Continuous Variables (Q4492663) (← links)
• QUANTUM COMPUTER: AN APPLIANCE FOR PLAYING MARKET GAMES (Q4659844) (← links)
• SPATIAL BELL STATE MEASUREMENT OF TWO PARTICLES (Q4663293) (← links)
• QUANTUM COMPUTATION BY MEASUREMENTS (Q4674238) (← links)
• Noncommutative tori and universal sets of nonbinary quantum gates (Q4832641) (← links)
• Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels (Q4832727) (← links)
• Efficient discrete approximations of quantum gates (Q4832734) (← links)
• An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity (Q4918005) (← links)