The tag has no wiki summary.

learn more… | top users | synonyms (2)

1
vote
1answer
80 views

Info request on studying QIT/QIS or QM with a Computer Science background [closed]

I've been considering a career change for a long time and recently discovered the Two-Slit Experiment, which, to put it frankly, blew my mind. I then started some hefty reading and investigation into ...
10
votes
0answers
393 views

Quantum computing records (entangled qubits)

What is the current record number of entagled qubits and how has this number been increased? The latest result on stack exchange, which is 3 years old, reports 14 via this post: How many stabilised ...
3
votes
1answer
291 views

Bra-ket notation, Bits, & Superposition

I am a quantum computing enthusiast, and recently I stumbled upon this the following two propositions: $$ \alpha|1\rangle + \beta|0\rangle$$ What does this mean? My understanding of this is that: ...
4
votes
0answers
280 views

Finding the ground state of the toric code Hamiltonian

How do I write by proof, the ground state of the toric code (by Kitaev) Hamiltonian $ H=-\sum_{v}A(v)-\sum_{p}B(p) $ where $A(v)=\sigma_{v,1}^{x}\sigma_{v,2}^{x}\sigma_{v,3}^{x}\sigma_{v,4}^{x}$ and ...
0
votes
2answers
214 views

Can you read and write a quantum state to a particle without collapsing its probability field?

I know the main problem with a quantum computer is that you can't read and write data from it until after it has run though all of its calculations. But would reading and writing quantum data to ...
1
vote
1answer
171 views

CNOT gate broken in 2 different quantum simulators? Or am I wrong?

My understanding is that the control qubit in a controlled-not gate remains unchanged after the controlled-not operation is performed on a target-qubit (so the Pauli-X gate is performed only on the ...
1
vote
2answers
146 views

Quantum Computation

Is there any rule or technique so that one can design quantum gate operator from matrix operator? Suppose, what will be the quantum gate operator for this matrix operator : $$ \left( \begin{array}{c ...
0
votes
0answers
83 views

How can a qubit superposition state be written to a quantum register?

If a 3 qubit register can simultaneously store all 8 possible values in superposition, then how it is achieved to write 8 values in to the register? And How these 8 values can be processed parallel to ...
8
votes
3answers
2k views

How are physics and computer science getting united? [closed]

How is theoretical computer science getting united with physics? Phenomena like Quantum Computing uses Quantum Mechanics to be able to compute things, how are computers helping not just to model our ...
4
votes
2answers
134 views

Approaches to Fault tolerant quantum computation

What are the various approaches to fault tolerant quantum computation ? Two examples are 1. topological quantum computation which uses topological phases in quantum states (2-Dimensional for ...
3
votes
2answers
293 views

Smallest number of quantum gates to simulate other gates?

What is the smallest number of Fredkin gates needed to simulate a Toffoli gate? What is the smallest number of Toffoli gates needed to simulate a Fredkin gate? Where the Toffoli's gate is the CCNOT ...
5
votes
1answer
331 views

Explanation for the power of quantum computers

I have seen various explanations for the power of quantum computers: Quantum computers perform operations in parallel universes Quantum computers can use quantum tunneling to reach a global extremum ...
3
votes
1answer
195 views

What does $|x⟩|0⟩$ actually mean in bra-ket notation?

Consider the following quote from Wikipedia's page on Shor's algorithm: Initialize the registers to $Q^{-1/2} \sum_{x=0}^{Q-1} \left|x\right\rangle \left|0\right\rangle$ where $x$ runs ...
3
votes
1answer
132 views

Understanding operations of quantum computing advantages

For example, let us examine the case of quantum (discrete) fourier transform. There are $2^N$ samples. How do we initialize these $2^N$ samples into $N$ qubits? I have a hard time understanding this. ...
10
votes
1answer
494 views

How does Landauer's Principle apply in quantum (and generally reversible) computing

I understand that a reversible computer does not dissipate heat through the Landauer's principle whilst running - the memory state at all times is a bijective function of the state at any other time. ...
1
vote
0answers
84 views

Usage example of stabilizer codes QEC

This question directly follows the previous one about $X$ stabilizers and phase-flip errors: Practical example of stabilizer codes Let's now consider a second part of the quantum circuit that is ...
1
vote
0answers
40 views

Which model of computation can be viewed as being extended by the currently most relevant models of quantum computation?

Which model of quantum computation resembles most closely the attempts of implementation currently being made? And which non-quantum model of computation is the conceptually closest one to the above ...
1
vote
0answers
56 views

Adiabatic evolution for initial Hamiltonian on Hadamard basis and problem Hamiltonian as diagonal

This is spawned from a comment at the answer to one of my previous questions. Someone suggested to me that claiming the following statement might be NP-hard. Could anyone please help me to figure out ...
1
vote
1answer
104 views

Practical example of stabilizer codes

Given the Steane code $$ \left|0\right\rangle_L \equiv \frac{1}{\sqrt{8}}(\left|0000000\right\rangle + \left|1010101\right\rangle + \left|0110011\right\rangle + \left|1100110\right\rangle + ...
1
vote
1answer
67 views

Confusion about a lemma on the time constraint of an adiabatic evolution (arXiv:quant-ph/0604077)

I am going through the paper Quantum adiabatic evolutions that can't be used to design efficient algorithms by Zhaohui Wei and Mingsheng Ying. On the second page they prove a lemma. The statement goes ...
2
votes
1answer
60 views

Purposes of QEC stabilizers

I am going through the idea of stabilizer formalism. Defined what is a Pauli group $P_n$ and its properties, we describe a stabilizer set $S$ as: $$S\subset P_n$$ The stabilizer set establishes ...
0
votes
2answers
124 views

Question on quantum computation, entanglement and speed of information propagation

Imagine a following thought experiment. Suppose we have a large amount of entangled particle pairs, several million or billion. Now suppose there are two observers, each carrying one member of ...
2
votes
0answers
84 views

How to obtain stabilizer's generators of a QEC code

The theory of QEC with stabilizer codes defines an alternative way to represent a quantum state in terms of operators. To understand better what I am concerning about, let's consider the 7-qubit ...
2
votes
0answers
112 views

Can we “safely” assume that quantum computing systems will be finite-dimensional?

This is a common assumption in the study of quantum computation to assume that the quantum systems involved are finite-dimensional, since qubits lives in the two-dimensional Hilbert space. According ...
1
vote
0answers
107 views

Beginner projects in NMR quantum computing [closed]

I have applied for a summer project in NMR quantum computing as I want to learn this field, but my professor wants me to tell him the project title. I have no idea about the field and what projects ...
4
votes
1answer
162 views

Entropy inequality

Assume that you have two bipartite systems $\rho_1^{AB},\rho_2^{AB}$ then I would like to prove the following: $$S(\frac{1}{2}( ...
5
votes
1answer
100 views

When is an operator subspace the span of Kraus operators?

Let $A$ and $B$ be finite dimensional Hilbert spaces, and let $\mathcal{L}(A \to B)$ be the space of linear operators from $A$ to $B$. Say that a subspace $K \subseteq \mathcal{L}(A \to B)$ is a span ...
2
votes
1answer
103 views

Coefficients of the vectors in a tensor product

The postulate says that if we want to build the compound state of two sub-systems, we just take the tensor product $\otimes$ of the respective state vectors. This means that if one of the vectors has ...
3
votes
0answers
121 views

Optimality of product input state in quantum channel

Let $\mathcal N^{A_1\rightarrow B_1}_1,..,\mathcal N^{A_1\rightarrow B_1}_k$ be a set of valid quantum evolutions with equal input and output dimensions. And let the effect of a channel on a system ...
4
votes
3answers
185 views

Quantum circuit equivalent of quantum pseudo-telepathy game

I'm trying to understand the wikipedia article on quantum pseudotelepathy. I've been trying to figure out the quantum circuits the players can use to win the game from the wiki article. (Level of ...
4
votes
3answers
1k views

What is the next step beyond quantum computation?

Assuming we develop quantum computers one day, what would be theoretically the next step? Would it be string-theory based computers? How would these computers differ performance-wise (ie what can they ...
5
votes
2answers
264 views

Is entanglement necessary for quantum computation?

Is entanglement necessary for quantum computation? If there was no error in the computation,superposition of states would be sufficient for quantum computation to be carried out.Is this right?
14
votes
2answers
1k views

Why doesn't the no-cloning theorem make lasers impossible?

As I understand lasers, you start off with a few photons that are in an identical state, and other photons that are created later tend to have the same quantum numbers due to Einstein-Bose statistics. ...
2
votes
0answers
106 views

Second quantization with qubits

Is "second quantization" means system wich can contain variable, unknown, superposed and otherwise uncertain number of qubits? Can "second quantized" system contain 0.5% of 1 qubit and 95% of 2 ...
5
votes
2answers
244 views

Classically efficient universal quantum computation (P=BQP) with magic and bound states

$\text P$ vs $\text {BQP}$ is an open question. That is, "can systems which require a polynomial number of qubits in the size of an input be described with only a polynomial number of bits?" If the ...
2
votes
2answers
214 views

Why does the classical equivalent to a quantum computer take so many bits?

A quantum computer with 10 qubits is classically equivalent to $2^{10}$ bits. How is this equivalence worked out? I understand that a single qubit is a vector in a 2-dimensional hilbert space, whose ...
0
votes
1answer
78 views

Adiabatic quantum Hamiltonian of variable dimension

Is adiabatic quantum Hamiltonian of variable dimension possible? This is very hypothetical and I am afraid may not have enough merit to belong to this forum. I would still like to elaborate. Here is ...
2
votes
1answer
701 views

Help on applying a Hadamard gate and CNOT to two single q-bits

I am stuck on a few issues in this video. (Note: It is at the frame concerning this question.) In it, from what I understand (which could be wrong) we first apply the Hadamard gate to a qbit in the ...
1
vote
2answers
344 views

Quantum XOR: How do you generalize it?

Consider the classical XOR Gate: Given a 2 bit system: $G = [u_1, u_2]$ $$XOR(G) = (u_1 + u_2) \ mod \ 2$$ Is the following a good generalizaiton of a Quantum XOR Gate: Given a 2-qubit system: ...
2
votes
0answers
131 views

Quantum annealing computing

What is Quantum Annealing and quantum annealing computing and what are its advantages and disadvantages with respect to quantum circuit quantum computing/computers?
3
votes
1answer
503 views

Measuring Entangled Qubits

Suppose we have a pair of entangled qubits. $$ |\psi\rangle = \frac{1}{ \sqrt{2} } ( |00\rangle + |11\rangle ) $$ Now we give one qubit to Alice and other to Bob. Alice measure the her qubit to ...
1
vote
1answer
404 views

CNOT gate output with both inputs in superposition

What is the output of a CNOT gate if both inputs are in superposition? For example, what happens if: $\left|x\right>=\alpha_x\left|0\right>+\beta_x\left|1\right>$ and ...
2
votes
0answers
55 views

The role of state space composition in quantum computation

In a paper by Richard Josza and Noah Linden they argue that the way state spaces of composite systems are formed is a key aspect in the benefits of quantum computers. In (classical) phase space, two ...
2
votes
1answer
329 views

Hamiltonian reduction having constant of the motion

I have this $2^n*2^n$ matrix that represent the evolution of a system of $n$ spin. I know that I can have only one excited spin in my configuration a time. (eg: 0110 nor 0101 ar not permitted, but ...
1
vote
1answer
516 views

Ising spin vs Pauli spin matrices

Are Ising spins scalar or operators? I am not a condensed matter physicist hence having some confusion. I have learnt about Ising models from adiabatic quantum algorithm papers. For example this ...
3
votes
1answer
821 views

Do quantum computers manufactured by D-Wave Systems, Inc. work? [duplicate]

D-wave claims to have built 128 qbit quantum computers which are commercially available? What I don't understand is that have they really been able to do this given that the scientific community is ...
0
votes
1answer
158 views

how many qubit do we need to store “16”?

classical computers store information in bits which can either be 0 or 1, but in quantum computer the qubit can store 0 , 1 or a state that is the superposition of these two states so how this ...
3
votes
0answers
79 views

What is three-photon interference?

Whilst reading this paper on a quantum processor that performs a type of matrix computation, I came across the concept of 'three-photon interference'. A quick Google search shows that this process is ...
8
votes
1answer
265 views

Positivity in the Pauli/Bloch/coherence vector representation

Suppose $\rho$ is an $n$-qubit state and $\vec{x}$ is a vector of coefficients in the Pauli representation (also called the Bloch or coherence vector). That is $$ x_k = {\rm Tr}(\rho \sigma_k), $$ ...
2
votes
0answers
103 views

Creating matrix Hamiltonian for Feynman's CCNOT [closed]

I'm trying to read Quantum Mechanical Computer and to implement the CCNOT logical gate with Mathematica. Since i wish to use the SWITCH implementation of the CNOT [Fig.8] i've realized that i need to ...